Automata, computability and complexity :
Rich, Elaine.
Automata, computability and complexity : theory and applications / Elaine Rich. - Upper Saddle River, N.J. : Pearson Prentice Hall, 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.
9780132288064 0132288060
2010275411
QA267 / .R53 2008
511.3
Automata, computability and complexity : theory and applications / Elaine Rich. - Upper Saddle River, N.J. : Pearson Prentice Hall, 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.
9780132288064 0132288060
2010275411
QA267 / .R53 2008
511.3