Hopcroft, John E. <br/><br/>
Introduction to automata theory, languages, and computation 

 - 1a ed. 
 - Reading :  ,  1979 
 - (Addison-Wesley series in computer science / Michael A. Harrison, ed.) .
<br/><br/> Copia anillada. -- 
<br/><br/>1- Preliminaries 2- Finite automata and regular expressions 3- Properties of regular sets 4- Context-free grammars 5- Pushdown automata 6- Properties of context-free languages 7- Turing machines 8- Undecidability 9- The Chomsky hierarchy 10- Deterministic context-free languages 11- Closure properties of families of languages 12- Computational complexity theory 13- Intractable problems 14- Highlights of other important language classes -- Bibliography (p. 396-410) -- Index. 
<br/><br/><label>ISBN: </label>020102988X 
<br/><br/><label>Standard No.: </label>DIF002433 
<br/><br/><label>Subjects--Topical Terms: </label><br/>AUTÓMATAS<br/>LENGUAJES FORMALES<br/>COMPLEJIDAD COMPUTACIONAL