An edition of An introduction to formal languages and automata
(1990)
An introduction to formal languages and automata
4th ed.
by Peter Linz
- 6 Want to read
- 3 Currently reading
- 1 Have read
Share
×Close
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
| Edition | Availability |
|---|---|
1
An introduction to formal languages and automata
2022, Jones and Bartlet Publishers, Inc
Paperback (also available in hardcover and eBook editions)
- 7th Edition
1284231607 9781284231601
|
zzzz
|
|
2
|
zzzz
|
3
An introduction to formal languages and automata
2007, Narosa Pub. House
in English
- 4th ed.
8173197814 9788173197819
|
aaaa
|
4
An introduction to formal languages and Automata
2006, Jones and Bartlett Publishers
in English
0763737984 9780763737986
|
zzzz
|
5
An introduction to formal languages and automata
2001, Jones and Bartlett
in English
- 3rd ed.
0763714224 9780763714222
|
eeee
|
6
An Introduction to Formal Languages and Automata
October 1, 2000, Jones & Bartlett Publishers
Hardcover
in English
- 3 edition
0763714224 9780763714222
|
zzzz
|
7
An introduction to formal languages and automata
1997, Jones and Bartlett Publishers
in English
- 2nd ed.
076370296X 9780763702960
|
zzzz
|
|
8
An introduction to formal languages and automata
1996, D.C.Heath
in English
- 2nd ed.
0669354031 9780669354034
|
zzzz
|
9
An introduction to formal languages and automata
1990, D.C. Heath
in English
0669173428 9780669173420
|
cccc
|
Book Details
Table of Contents
Introduction to the theory of computation. mathematical preliminaries and notation ; Three basic concepts ; Some applications
Finite automata. Deterministic finite accepters ; Nondeterministic finite accepters
A hierarchy of formal languages and automata. Recursive and recursively enumerable languages ; Unrestricted grammars ; Context-sensitive grammars and languages ; The Chomsky hierarchy
Limits of algorithmic computation. Some problems that cannot be solved by Turing machines ; Undecidable problems for recursively enumerable languages ; The post correspondence problem ; Undecidable problems for context-free languages ; A question of efficiency
Other models of computation. Recursive functions ; Post systems ; Rewriting systems
An overview of computational complexity. Efficiency of computation ; Turing machine models and complexity ; Language families and complexity classes ; The complexity classes P and NP ; Some NP problems ; Polynomial-time reduction ; NP-completeness and an open question.
Edition Notes
Reprint. Originally published: Sudbury, Mass. : Jones and Bartlett Publishers, 2006.
Includes bibliographical references (page 409) and index.
Classifications
External Links
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
History
- Created March 27, 2021
- 3 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| March 28, 2025 | Edited by ImportBot | Redacting ocaids |
| January 15, 2023 | Edited by ImportBot | import existing book |
| March 27, 2021 | Created by MARC Bot | Imported from Internet Archive item record |