Introduction to automata theory, languages, and computation
Hopcroft, John E.
Introduction to automata theory, languages, and computation - 1a ed. - Reading : , 1979 - (Addison-Wesley series in computer science / Michael A. Harrison, ed.) .
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.
020102988X
DIF002433
AUTÓMATAS
LENGUAJES FORMALES
COMPLEJIDAD COMPUTACIONAL
Introduction to automata theory, languages, and computation - 1a ed. - Reading : , 1979 - (Addison-Wesley series in computer science / Michael A. Harrison, ed.) .
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.
020102988X
DIF002433
AUTÓMATAS
LENGUAJES FORMALES
COMPLEJIDAD COMPUTACIONAL