TY  - GEN
AU  - Hopcroft, John E.
AU  - Ullman, Jeffrey D.
TI  - Introduction to automata theory, languages, and computation
SN  - 8185015961
U1  - 629.831 
PY  - 1987///
CY  - New Delhi
PB  - Narosa Publication
KW  - Machine theory
KW  - Formal languages
KW  - Computational complexity
N1  - 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
N2  - This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.
ER  -