| 000 | 01434nam a22002657a 4500 | ||
|---|---|---|---|
| 001 | 551 | ||
| 003 | AR-FRRoUTN | ||
| 008 | 240530t1997 |||a||||r|||| 001 0 eng d | ||
| 020 | _a9780471137726 | ||
| 040 | _aUNT FRRo | ||
| 080 | 0 |
_a004 _22015 |
|
| 100 | 1 |
_aCohen, Daniel I. A. _d1946- |
|
| 245 | 1 | 0 |
_aIntroduction to computer theory / _cDaniel I. A. Cohen. |
| 250 | _a2nd. | ||
| 260 |
_aNew York : _bJohn Wiley & Sons, _c1997. |
||
| 300 |
_a634 p. : _bil. ; _c25 cm |
||
| 336 |
_2rdacontent _atexto _btxt |
||
| 337 |
_2rdamedia _asin mediación _bn |
||
| 338 |
_2rdacarrier _avolumen _bnc |
||
| 505 | 0 | _a1. Background. -- 2. Languages. -- 3. Recursive definitions. -- 4. Regular expressions. -- 5 Finite automata. -- 6. Transition graphs. -- 7. Kleenea´s theorem. -- 8. Finite automata with output. -- 9. Regular languages.. -- 10. Nonregular languages. -- 1. Decidability. -- Part II. PUSHDOWN AUTOMATA THEORY: -- 12 Context--Free grammars. -- 13. Grammatical format. -- 14. Pushdown automata. -- 15. CFG = PDA. -- 16. Non--Context--Free languages. -- 17 Context--Free languages. -- 18. Decidability. -- Part III. TURING THEORY: -- 19. Turing machines. -- 20. Post machines. -- 21 Minskya s theorem. -- 22 Variations on the TM. -- 23. TM languages. -- 24. The Chomsky hierarchy. -- 25. Computers. | |
| 650 | 1 | 4 | _aLENGUAJES DE PROGRAMACIÓN |
| 650 | 1 | 4 | _aTEORÍA DE LA COMPUTACIÓN |
| 942 |
_2udc _cBK |
||
| 999 |
_c551 _d551 |
||