• General

    Teoría de Autómatas y Lenguajes Formales (2010)

    • Bibliografía

      Bibliografía Básica

      • R. Cases, L Marquez. Llenguatges, gramàtiques i autòmats. Curs bàsic, Edicions UPC, 2003.
      • J.E. Hopcroft, R. Motwani, J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 2001 (2a ed.).
      • J. Gruska. Foundations of computing. International Thomson Computer Press, 1997.
      • D. Kozen. Automata and Computability. Springer-Verlag, 1997.
      • H.R. Lewis, C. Papadimitriou. Elements of the Theory of Computation. Prentice-Hall, Eglewood Cliffs, NJ, 1998 (2a ed.).
      • D. Kelley. Automata and Formal Languages. Prentice Hall, 1995.


      Bibliografía Complementaria

      • Alfred V. Aho, John E. Hopcroft, y Jeffrey D. Ullman. The design and analysis of computer algorithms. Addison-Weslwy Publishing Co., Reading, Mass. -London-Amsterdam, 1975.
      • Alfred V. Aho y Jeffrey D. Ullman. The theory of parsing, translation, and compiling, Vol I: Parsing. Pretince-Hall Inc., Englewood Cilffs, N.J., 1972.
      • Noam Chomsky. Syntactic Structures. Mouton and Co., The Hague, 1957
      • Noam Chomsky. Context-free grammars and pushdown storage. Quaterly Progress Report, 65, 1962.
      • John Cocke and Jakob Schwartz. Programming languages and their compilers. Courant Institute of Mathematical Sciences, New York University, 1970.
      • Ding-Zhu and Ker-I Ko. Problem Solving in Automata, Languages and Complexity. John Wiley and Sons, INC, 2001.
      • Terence Parr. The Definitive ANTLR Reference. Programatic Bookshelf, United States of America, 2007.