TY  - BOOK
AU  - Hopcroft,John E.
AU  - Ullman,Jeffrey D.
TI  - Introduction to automata theory, languages, and computation
SN  - 020102988X
PY  - 1979///
CY  - Reading
PB  - Addison-Wesley
KW  - MACHINE THEORY
KW  - FORMAL LANGUAGES
KW  - COMPUTATIONAL COMPLEXITY
KW  - FINITE AUTOMATA
KW  - REGULAR SETS
KW  - AUTOMATAS
KW  - CIBERNETICA
N1  - CONTENIDO
Finite automata and regular expressions
Properties of regular sets
Context-free grammars
Pushdown automata
Properties of context-free languages
Turing machines
Undecidability
The Chomsky hierarchy
Deterministic contest-free languages
Closure properties of families of languages
Computational complexity theory
Intractable problems
Highlights of other important language classes
ER  -