Introduction to automata theory, languages, and computation

By:

Hopcroft, John E

Contributor(s):

Ullman, Jeffrey D

Material type: Text

TextSeries: Addison-Wesley series in computer sciencePublication details: Reading : [S.n.], 1979Edition: 1a edISBN:

020102988X

Subject(s):

Contents:

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.

Average rating: 0.0 (0 votes)

Holdings
Item type	Home library	Call number	Status	Date due	Barcode
Libro	Biblioteca de la Facultad de Informática	F.1.1 HOP (Browse shelf(Opens below))	Available		DIF-F156

Browsing Biblioteca de la Facultad de Informática shelves Close shelf browser (Hides shelf browser)

Previous								Next
Previous	F.1.1 HEN Introduction to computability	F.1.1 HOP Introduction to automata theory, languages, and computation	F.1.1 HOP Introduction to automata theory, languages, and computation	F.1.1 HOP Introduction to automata theory, languages, and computation	F.1.1 HOP Introducción a la teoría de autómatas, lenguajes y computación	F.1.1 HOP Introducción a la teoría de autómatas, lenguajes y computación	F.1.1 JON Computability theory : an introduction	Next

Copia anillada. --

Click on an image to view it in the image viewer