| 000 | 01456cam a2200361 a 4500 | ||
|---|---|---|---|
| 001 | 436031091 | ||
| 003 | ghu | ||
| 005 | 20260607134349.0 | ||
| 007 | ta | ||
| 008 | 090929s2011 nyua b 001 0 eng | ||
| 010 | _a9780071289429 | ||
| 020 | _a9780071289429 | ||
| 020 | _a9780071289429 | ||
| 020 | _a9780071289429 | ||
| 020 | _a0071289429 | ||
| 035 | _a(OCoLC)436031091 | ||
| 040 |
_aDLC _beng _cGHU _dGHULIB _erda |
||
| 050 | _aQA 267.5 MAR | ||
| 090 | 0 | _aQA 267.5.S4 MAR | |
| 100 | 1 | 0 |
_aMartin, John C., _eauthor. |
| 245 | 1 | 0 |
_aIntroduction to languages and the theory of computation / _cJohn C. Martin. |
| 250 | _aFourth edition. | ||
| 264 | 1 |
_aNew York, NY : _bMcGraw-Hill, _c2011. |
|
| 300 |
_axii, 436 pages : _billustrations ; _c24 cm. |
||
| 336 |
_atext _btxt _2rdacontent. |
||
| 337 |
_aunmediated _bn _2rdamedia. |
||
| 338 |
_avolume _bnc _2rdacarrier. |
||
| 504 | _aIncludes bibliographical references (pages 425-426) and index. | ||
| 505 | 0 | _aMathematical tools and techniques -- Finite automata and the languages they accept -- Regular expressions, nondeterminism, and Kleene's Theorem -- Context-free languages -- Pushdown automata -- Context-free and con-context-free languages -- Turing machines -- Recursively enumerable languages -- Undecidable problems -- Computable functions -- Introduction to computational complexity. | |
| 650 | 0 | _aSequential machine theory. | |
| 650 | 0 | _aComputable functions. | |
| 942 |
_2lcc _cBOOK _n0 |
||
| 999 |
_c832 _d832 |
||