TY  - GEN
AU  - Hopcroft,John E.
AU  - Ullman,Jeffrey D.
TI  - Introduction to automata theory, languages, and computation / 
T2  - Addison-Wesley series in computer science
SN  - 8185015961
U1  - 005.133,HOP 
PY  - 1979///
CY  - New Delhi
PB  - Narosa publishing house
KW  - Computational complexity
KW  - Formal languages
KW  - Machine theory
N1  - Preliminaries (Page-1), Finite Automata and Regular Expressions (Page-13), Properties of Regular Sets (Page-55), Context-Free Grammars (Page-77), Pushdown Automata (Page-107), Properties of Context-Free Language (Page-125), Turing Machines (Page-146), Undecidability (Page-177),  The Chomsky Hierarchy (Page-217), Deterministic Context-Free Languages (Page-234), Closure Properties of Families of Languages (Page-270), Computational Complexity Theory (Page-285), Intractable Problems (Page-320), Highlights of other Important Language Classes (Page-377),
ER  -