Automata theory /
"This book covers substantially the central ideas of a one semester course in automata theory. It is oriented towards a mathematical perspective that is understandable to non-mathematicians. Comprehension is greatly aided by many examples, especially on the Chomsky - Schutzenberger theorem, whi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Singapore ; River Edge, N.J. :
World Scientific,
1999.
|
| Subjects: |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | b729db1d-47b8-4374-a0de-fb6d96d1a439 | ||
| 005 | 20240707000000.0 | ||
| 008 | 981223s1999 si a b 001 0 eng | ||
| 010 | |a 98055728 | ||
| 020 | |a 9810237537 |q (alk. paper) | ||
| 020 | |a 9789810237530 |q (alk. paper) | ||
| 020 | |a 9810237545 |q (pbk. : alk. paper) | ||
| 020 | |a 9789810237547 |q (pbk. : alk. paper) | ||
| 035 | |a (MnManS)002805405SYS01 | ||
| 035 | |a ocm40602694 | ||
| 035 | |a (EXLNZ-01MNPALS_NETWORK)9910042246804266 | ||
| 040 | |a DLC |b eng |c DLC |d MUQ |d BAKER |d BTCTA |d YDXCP |d ZWZ |d DEBBG |d ILU |d OCLCF |d OCLCQ |d OCLCO | ||
| 049 | |a XMNY | ||
| 050 | 0 | 0 | |a QA267 |b .S536 1999 |
| 082 | 0 | 0 | |a 511.3 |2 21 |
| 084 | |a ST 130 |2 rvk | ||
| 100 | 1 | |a Simon, Matthew. | |
| 245 | 1 | 0 | |a Automata theory / |c Matthew Simon. |
| 260 | |a Singapore ; |a River Edge, N.J. : |b World Scientific, |c 1999. | ||
| 300 | |a xii, 428 pages : |b illustrations ; |c 26 cm | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a unmediated |b n |2 rdamedia | ||
| 338 | |a volume |b nc |2 rdacarrier | ||
| 504 | |a Includes bibliographical references (pages 419-423) and index. | ||
| 505 | 0 | 0 | |g Ch. 0. |t Mathematical Preliminaries -- |g Ch. 1. |t Sequential Machines -- |g Ch. 2. |t Finite State Automata -- |g Ch. 3. |t Chomsky Grammars -- |g Ch. 4. |t Formal Power Series -- |g Ch. 5. |t Turing Machines -- |g Ch. 6. |t Pushdown Automata -- |g Ch. 7. |t Context-Sensitive (Type-1) Languages -- |g Ch. 8. |t Lindenmeyer (Developmental) [actual symbol not reproducible] Systems, Syntactic Pattern Recognition and Shape Grammars -- |g App. A. |t Group Theory: A Short Introduction -- |g App. B. |t Turing Machine State-Transition Diagrams -- |g App. C. |t Turing Machines and Computable Functions -- |g App. D. |t Turing Machine and Complexity 400 -- |g App. E. |t Construction of DPda from LR(k) Parser. |
| 520 | 1 | |a "This book covers substantially the central ideas of a one semester course in automata theory. It is oriented towards a mathematical perspective that is understandable to non-mathematicians. Comprehension is greatly aided by many examples, especially on the Chomsky - Schutzenberger theorem, which is not found in most books in this field."--Jacket. | |
| 583 | 1 | |a committed to retain |c 07012023 |d 12312042 |f Minnesota Shared Print Program |5 MnManS |z MNSU, Mankato Retention Commitment | |
| 650 | 0 | |a Machine theory. | |
| 650 | 6 | |a Automates mathématiques, Théorie des. | |
| 650 | 7 | |a Machine theory. |2 fast |0 (OCoLC)fst01004846 | |
| 650 | 7 | |a Automates mathématique, théorie des. |2 ram | |
| 650 | 0 | 7 | |a Automatentheorie. |2 swd |
| 999 | 1 | 0 | |i b729db1d-47b8-4374-a0de-fb6d96d1a439 |l 990028054050104301 |s US-MNMANS |m automata_theory____________________________________________________________1999_______worlda________________________________________simon__matthew_____________________p |
| 999 | 1 | 0 | |i b729db1d-47b8-4374-a0de-fb6d96d1a439 |l 9922170770001701 |s US-MNU |m automata_theory____________________________________________________________1999_______worlda________________________________________simon__matthew_____________________p |
| 999 | 1 | 1 | |l 990028054050104301 |s ISIL:US-MNMANS |i Minnesota State University, Mankato |t BKS |a GEN |c QA267 .S536 1999 |b 30101017732454 |x BOOK |y 2374165760004301 |p LOANABLE |
| 999 | 1 | 1 | |l 9922170770001701 |s ISIL:US-MNU |i University of Minnesota |t BKS |a TSCIGEN |c QA267 .S536 1999 |d LCC |b 31951D022397882 |x BOOK |y 23347935510001701 |p LOANABLE |