Straubing, Howard. <br/><br/>
Finite automata, formal logic, and circuit complexity 

 - Boston :   Birkhäuser,  1994. 
 - xii, 226p. :  ill. ;  22 cm. 
 - Progress in Theoretical Computer Science .
<br/><br/>Includes bibliographical references and index.<br/><br/> 
<br/><br/><label>ISBN: </label>9781461266952 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Automata<br/>Machine Theory<br/>Robotics<br/>Robots<br/>Computer Science<br/>Mathematics<br/>Mathematical Logic <br/>Symbolic Logic<br/>Computational Complexity
<br/><br/><label>Dewey Class. No.: </label>511.3  / STR