| 000 | 01260nam a2200241Ia 4500 | ||
|---|---|---|---|
| 003 | NULRC | ||
| 005 | 20250520100703.0 | ||
| 008 | 250520s9999 xx 000 0 und d | ||
| 020 | _a9780073191461 | ||
| 040 | _cNULRC | ||
| 050 | _aQA 267.5.S4 .M37 2011 | ||
| 100 |
_aMartin, John C. _eauthor |
||
| 245 | 0 |
_aIntroduction to languages and the theory of computation / _cJohn C. Martin |
|
| 250 | _aFourth Edition | ||
| 260 |
_aNew York : _bMcGraw Hill Education, _cc2011 |
||
| 300 |
_axii, 436 pages ; _c24 cm. |
||
| 365 | _bUSD424.04 | ||
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | _aChapter 1. Mathematical tools and techniques -- Chapter 2. Finite automata and the language they accept -- Chapter 3. Regular expressions, nondeterminism, and Kleene's theorem -- chapter 4. Context-free languages -- Chapter 5. Pushdown automata -- Chapter 6. Context-free and non-context-free languages -- Chapter 7. Turing machines -- Chapter 8. Recursively enumerable languages -- Chapter 9. Undecidable problems -- Chapter 10. Computable functions -- Chapter 11. Introduction to computational complexity. | ||
| 520 | _aThis book is an introduction to the theory of computation. | ||
| 650 | _aSEQUENTIAL MACHINE THEORY | ||
| 942 |
_2lcc _cBK |
||
| 999 |
_c11453 _d11453 |
||