Rich, Elaine. <br/><br/>
Automata, computability and complexity :  theory and applications / 
Elaine Rich. 
 - xx, 1097 pages :  illustrations ;  25 cm. 
<br/><br/>Includes bibliographical references and index. 
<br/><br/>Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity. 
<br/><br/><label>ISBN: </label>0132346176 9780132346177 
<br/><br/><label>LCCN: </label>2010275411 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Machine theory.<br/>Computable functions.<br/>Computational complexity.<br/>Electronic data processing.
<br/><br/><label>LC Class. No.: </label>QA267  / .R53 2008 
<br/><br/><label>Dewey Class. No.: </label>511.3