Cohen, Daniel I. A. 1946- creator text New York John Wiley & Sons 1997 2nd. monographic eng 634 p. : il. ; 25 cm 1. 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. Daniel I. A. Cohen. LENGUAJES DE PROGRAMACIÓN TEORÍA DE LA COMPUTACIÓN 004 9780471137726 UNT FRRo 240530 551