000 02336nam a2200301 i 4500
999 _c889903
_d889903
003 OSt
008 110630s2010 us 001 0 eng c
020 _a978-0071289429
040 _aUCA-ESI
_cUCA
_bspa
100 1 _aMartin, John C..
245 1 0 _aIntroduction to languages and theory of computation /
_cJohn C. Martin
250 _a4ª ed.
260 _aNew York :
_bMcGraw-Hill,
_c2011.
300 _axii, 436 p. ;
_c24 cm.
505 0 _aÍndice abreviado: 1. Mathematical tools and techniques 2. Finite automata and the languages they accept 3. Regular expressions, nondeterminism, and Kleene's theorem 4. Context-free languages 5. Pushdown automata 6. Context-free and not-context-free languages 7. Turing machines 8. Recursively enumerable languages 9. Undecidable problems 10. Computable functions 11. Intoduction to computational complexity . Solutions to selected exercices. Selected bibliography. Index of notation. Index.
650 0 4 _aLenguajes de programación.
_91896
650 0 4 _aAutómatas matemáticos, Teoría de.
_91937
650 0 4 _aFunciones calculables
_911384
650 0 0 _aProgramming languages (Electronic computers)
650 0 0 _aMachine theory.
650 0 0 _aComputable functions.
907 _a84ln
907 0 _aprp
_besi130307
942 _n0
_2cdu
998 _b0
_c130307
_dm