| 000 | 01452nam a2200229Ia 4500 | ||
|---|---|---|---|
| 003 | NULRC | ||
| 005 | 20250520094853.0 | ||
| 008 | 250520s9999 xx 000 0 und d | ||
| 020 | _a9780201029888 | ||
| 040 | _cNULRC | ||
| 050 | _aQA 237 .H67 1979 | ||
| 100 |
_aHopcroft, John E. _eauthor |
||
| 245 | 0 |
_aIntroduction to automata theory, languages, and computation / _cJohn E. Hopcroft and Jeffrey D. Ullman. |
|
| 260 |
_aMassachusetts : _bAddision-Wesley Publishing Company, _cc1979 |
||
| 300 |
_ax, 411 pages ; _c21 cm. |
||
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | _aChapter 1. Preliminaries -- Chapter 2. Finite automata and regular expressions -- Chapter 3. Properties of regular sets -- Chapter 4. Context-free grammar -- Chapter 5. Pushdown automata -- Chapter 6. Properties of context-free languages -- Chapter 7. Turing machines -- Chapter 8. Undecidability -- Chapter 9. The chomsky hierarchy -- Chapter 10. Deterministic context-free languages -- Chapter 11. Closure properties of families of languages -- Chapter 12. Computational complexity theory -- Chapter 13. Intractable problems -- Chapter 14. Highlights of other important language classes. | ||
| 520 | _aTen years ago the authors undertook to produce a book converting the known material on formal languages, automata theory, and computational complexity. | ||
| 650 | _aMACHINE THEORY | ||
| 700 |
_aUllman, Jeffrey D. _eco-author |
||
| 942 |
_2lcc _cBK |
||
| 999 |
_c4870 _d4870 |
||