TY  - BOOK
AU  - Hopcroft,John E.
AU  - Ullman,Jeffrey D.
TI  - Introduction to automata theory, languages, and computation
T2  - Addison-Wesley series in computer science
SN  - 020102988X
PY  - 1979///
CY  - Reading
PB  - [S.n.]
KW  - AUTÓMATAS
KW  - LENGUAJES FORMALES
KW  - COMPLEJIDAD COMPUTACIONAL
N1  - Copia anillada. --;  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
ER  -