TY  - BOOK
AU  - Rich, Elaine
TI  - Automata, computability and complexity : : theory and applications
SN  - 9788131788226
U1  - 511.3 
PY  - 2012///
CY  - Noida
PB  - Pearson Education, 
KW  - Machine theory
KW  - Computable functions
KW  - Computational complexity
KW  - Electronic data processing
KW  - Formal languages
N1  - Finite state machines and regular languages --
; Context-free languages and pushdown automata --
; Turing machines and undecidability --
; Complexity
N2  - Combining classic theory with unique applications, this crisp narrative is supported by abundant examples and clarifies key concepts by introducing important uses of techniques in real systems. Broad-ranging coverage allows instructors to easily customize course material to fit their unique requirements
ER  -