| 000 | 01357cam a2200337 i 4500 | ||
|---|---|---|---|
| 999 |
_c792 _d792 |
||
| 001 | 3684555 | ||
| 003 | OSt | ||
| 005 | 20210212152609.0 | ||
| 008 | 781222s1979 maua b 001 0 eng | ||
| 010 | _a 78067950 | ||
| 020 |
_a9788131720479 _c$20.00 |
||
| 040 |
_aDLC _cDLC _dDLC |
||
| 050 | 0 | 0 |
_aQA267 _b.H56 |
| 082 | 0 | 0 |
_a519.713 _bHOP |
| 100 | 1 | _aHopcroft, John E., | |
| 245 | 1 | 0 |
_aIntroduction to automata theory, languages, and computation / _cJohn E. Hopcroft, Jeffrey D. Ullman. |
| 260 |
_aReading, Mass. : _bAddison-Wesley, _cc1979. |
||
| 300 |
_a 487 p. : _bill. ; _c24 cm. |
||
| 500 | _aIncludes index. | ||
| 505 |
_t1 Automata: The Methods and the Madness _t2 Finite Automata _t3 Regular Expressions and Languages _t4 Properties of Regular Languages _t5 Context-Free Grammars and Languages _t6 Pushdown Automata _t7 Properties of Context-Free Languages _t8 Introduction to Turing Machines _t9 Undecidability _t10 Intractable Problems _t11 Additional Classes of Problems |
||
| 650 | 0 | _aMachine theory. | |
| 650 | 0 | _aFormal languages. | |
| 650 | 0 | _aComputational complexity. | |
| 700 | 1 | _aUllman, Jeffrey D., | |
| 942 |
_2ddc _cBK |
||
| 100 | 1 | _d1939- | |
| 490 | 0 | _aAddison-Wesley series in computer science | |
| 504 | _aBibliography: p. 396-410. | ||
| 700 | 1 |
_d1942- _ejoint author. |
|
| 906 |
_a7 _bcbc _corignew _d1 _eopcn _f19 _gy-gencatlg |
||