Hopcroft, John E.  1939- <br/><br/>
Introduction to automata theory, languages, and computation / 
John E. Hopcroft, Jeffrey D. Ullman. 
 - Reading :  Addison-Wesley,  1979. 
 - 418 p. 
<br/><br/>CONTENIDO<br/>Finite automata and regular expressions<br/>Properties of regular sets<br/>Context-free grammars<br/>Pushdown automata<br/>Properties of context-free languages<br/>Turing machines<br/>Undecidability<br/>The Chomsky hierarchy<br/>Deterministic contest-free languages<br/>Closure properties of families of languages<br/>Computational complexity theory<br/>Intractable problems<br/>Highlights of other important language classes 
<br/><br/><label>ISBN: </label>020102988X 
<br/><br/><label>Subjects--Topical Terms: </label><br/>MACHINE THEORY<br/>FORMAL LANGUAGES<br/>COMPUTATIONAL COMPLEXITY<br/>FINITE AUTOMATA<br/>REGULAR SETS<br/>AUTOMATAS<br/>CIBERNETICA
<br/><br/><label>Universal Decimal Class. No.: </label>007.52 H77 EN 1979