Bibliografía básica
- Angluin, D. 1980. Finding patterns common to a set of strings. Journal of Computer and System Sciences.21:4662.
- Chomsky, N. 1956. Three models for the description of language. IRE Trans. on Information Theory.2(2):113124.
- Chomsky, N. 1963. Formal properties of grammars. In Handbook of Mathematical PsychologyVol. 2, 323418. John Wiley and Sons, New York.
- Chomsky, N. and Miller, G. 1958. Finitestate languages. Information and Control.1:91112.
- Drobot, V. 1989. Formal Languages and Automata Theory.Computer Science Press, Rockville, MD.
- Floyd, R.W. and Beigel, R. 1994. The Language of Machines: an Introduction to Computability and Formal Languages.Computer Science Press, New York.
- Gurari, E. 1989. An Introduction to the Theory of Computation.Computer Science Press, Rockville, MD.
- Harel, D. 1992. Algorithmics: The Spirit of Computing.AddisonWesley, Reading, MA.
- Harrison, M. 1978. Introduction to Formal Language Theory. AddisonWesley, Reading, MA.
- Hopcroft, J. and Ullman, J. 1979. Introduction to Automata Theory, Languages and Computation.AddisonWesley, Reading, MA.
- Jiang, T., Li, M., Ravikumar, B. and Regan, K.W. 2002. Formal grammars and languages.Retrieved on December 7, 2015, from http://www.cs.ucr.edu/~jiang/cs215/taonew.pdf.
- Jiang, T., Salomaa, A., Salomaa, K., and Yu, S. 1995. Decision problems for patterns. Journal of Computer and System Sciences.50(1):5363.
- Kleene, S. 1956. Representation of events in nerve nets and finite automata. In Automata Studies,341. Princeton University Press, NJ.
- Kleene, S. 1952. Introduction to Metamathematics.WaltersNoordhoff & NorthHolland.
- Lind, D. and Marcus, 1995 Symbolic Dynamics,Academic Press.
- Normann, D. 2010. Introduction to Computability Theory.Retrieved on December 7, 2015, from http://www.mn.uio.no/math/tjenester/kunnskap/kompendier/comptheory.pdf. [Post, 1943] Post, E. 1943. Formal reductions of the general combinatorial decision problems. Amer. J. Math.65:197215.
- Ramos, G., Morales, R. (2011) Teoría de Autómatas y Lenguajes Formales. Edición de Autor.
- Ruohonen,K.(2009).Formal languages. Retrieved on December7, 2015, from http://math.tut.fi/~ruohonen/FL.pdf.
- Salomaa, A. 1966. Two complete axiom systems for the algebra of regular events. J. ACM.13(1):158169.
- Searls, D. 1993. The computational linguistics of biological sequences. In Artificial Intelligence and Molecular Biology.L. Hunter (ed.), MIT Press, 1993, pp. 47120.
- Wood, D. 1987. Theory of Computation. Harper and Row.
Última modificación: viernes, 23 de marzo de 2018, 12:01