FEEDBACK Smiley face
Rich, Elaine.

Automata, computability and complexity : theory and applications Elaine Rich. - New Delhi : Pearson, c2008. - xx, 1099 p. : ill. ; 25 cm.

Includes bibliographical references and index.

Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.

9788131788226

2010275411


Machine theory.
Computable functions.
Computational complexity.
Electronic data processing.

QA267 / .R53 2008

511.3 / RIC-A

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in