Cohen, Daniel I. A.  1946- <br/><br/>
Introduction to computer theory /  
Daniel I. A. Cohen. 
 - 2nd. 
 - New York :   John Wiley & Sons,   1997. 
 - 634 p. :   il. ;  25 cm 
<br/><br/>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. 
<br/><br/><label>ISBN: </label>9780471137726 
<br/><br/><label>Subjects--Topical Terms: </label><br/>LENGUAJES DE PROGRAMACIÓN<br/>TEORÍA DE LA COMPUTACIÓN
<br/><br/><label>Universal Decimal Class. No.: </label>004