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 :
AV  - QA267 .H56
U1  - 005.13 
PY  - 1979///
CY  - Reading, Mass., New Delhi
PB  - Addison-Wesley, Narosa Publishing
KW  - Machine theory
KW  - Formal languages
KW  - Computational complexity
N1  - Includes index; Bibliography: p. 396-410; TOC;  	Preliminaries --
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 context-free languages --
Closure properties of families of languages --
Computational complexity theory --
Intractable problems --
Highlights of other important language classes; CSE
UR  - https://www.worldcat.org/title/introduction-to-automata-theory-languages-and-computation/oclc/4549363&referer=brief_results
ER  -