Automata, computability and complexity :
Rich, Elaine
Automata, computability and complexity : theory and applications Elaine Rich - Noida : Pearson Education, 2012. - xx, 1099 pages : illustrations ; 25 cm
Finite state machines and regular languages --
Context-free languages and pushdown automata --
Turing machines and undecidability --
Complexity.
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.
9788131788226
Machine theory
Computable functions
Computational complexity
Electronic data processing
Formal languages
511.3 / RIC
Automata, computability and complexity : theory and applications Elaine Rich - Noida : Pearson Education, 2012. - xx, 1099 pages : illustrations ; 25 cm
Finite state machines and regular languages --
Context-free languages and pushdown automata --
Turing machines and undecidability --
Complexity.
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.
9788131788226
Machine theory
Computable functions
Computational complexity
Electronic data processing
Formal languages
511.3 / RIC