Automata, Computability and Complexity : Theory and Applications /
Elaine Rich.
- New Delhi Pearson Prentice Hall, 2008.
- xx, 1099 p. : ill. ; 25 cm. Paperback
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.