Introduction to automata theory, languages, and computation /
Hopcroft, John E. 1939-
Introduction to automata theory, languages, and computation / John E. Hopcroft, Jeffrey D. Ullman. - Reading : Addison-Wesley, 1979. - 418 p.
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
020102988X
MACHINE THEORY
FORMAL LANGUAGES
COMPUTATIONAL COMPLEXITY
FINITE AUTOMATA
REGULAR SETS
AUTOMATAS
CIBERNETICA
007.52 H77 EN 1979
Introduction to automata theory, languages, and computation / John E. Hopcroft, Jeffrey D. Ullman. - Reading : Addison-Wesley, 1979. - 418 p.
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
020102988X
MACHINE THEORY
FORMAL LANGUAGES
COMPUTATIONAL COMPLEXITY
FINITE AUTOMATA
REGULAR SETS
AUTOMATAS
CIBERNETICA
007.52 H77 EN 1979