Rich, Elaine. <br/><br/>
Automata, computability and complexity :  theory and applications / 
Elaine Rich. 
 - New Delhi :  Pearson ,  c2012. 
 - xx, 1099 p. : 
<br/><br/>Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity. 
<br/><br/><label>ISBN: </label>9788131788226 0132288060 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Machine theory.<br/>Computable functions.<br/>Computational complexity.<br/>Electronic data processing.
<br/><br/><label>Dewey Class. No.: </label>519.713  / RIC