Bibliografia

Acciones de Documento
  • Enviar esto
  • Imprimir esto
  • Vista de contenidos
  • Marcadores (bookmarks)

Bibliografía básica

  • Angluin, D. 1980. Finding patterns common to a set of strings. J​ournal of Computer and System Sciences.​21:46­62.
  • Chomsky, N. 1956. Three models for the description of language. I​RE Trans. on Information Theory.​2(2):113­124.
  • Chomsky, N. 1963. Formal properties of grammars. In H​andbook of Mathematical Psychology​Vol. 2, 323­418. John Wiley and Sons, New York.
  • Chomsky, N. and Miller, G. 1958. Finite­state languages. Information and Control.​1:91­112.
  • Drobot, V. 1989. F​ormal Languages and Automata Theory.​Computer Science Press, Rockville, MD.
  • Floyd, R.W. and Beigel, R. 1994. T​he Language of Machines: an Introduction to Computability and Formal Languages.​Computer Science Press, New Y ork.
  • Gurari, E. 1989. A​n Introduction to the Theory of Computation.​Computer Science Press, Rockville, MD.
  • Harel, D. 1992. A​lgorithmics: The Spirit of Computing.​Addison­Wesley, Reading, MA.
  • Harrison, M. 1978. I​ntroduction to Formal Language Theory.​ Addison­Wesley, Reading, MA.
  • Hopcroft, J. and Ullman, J. 1979. I​ntroduction to Automata Theory, Languages and Computation.​Addison­Wesley, Reading, MA.
  • Jiang, T., Li, M., Ravikumar, B. and Regan, K.W. 2002. F​ormal grammars and languages.​Retrieved on December 7, 2015, from http://www.cs.ucr.edu/~jiang/cs215/tao­new.pdf.​
  • Jiang, T., Salomaa, A., Salomaa, K., and Yu, S. 1995. Decision problems for patterns. J​ournal of Computer and System Sciences.​50(1):53­63.
  • Kleene, S. 1956. Representation of events in nerve nets and finite automata. In A​utomata Studies,​3­41. Princeton University Press, NJ.
  • Kleene, S. 1952. I​ntroduction to Metamathematics.​Walters­Noordhoff & North­Holland.
  • Lind, D. and Marcus, 1995 S​ymbolic Dynamics,​Academic Press.
  • Normann, D. 2010. I​ntroduction 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. A​mer. J. Math.​65:197­215.
  • Ramos, G., Morales, R. (2011) T​eoría de Autómatas y Lenguajes
  • Formales.​Edición de Autor.
  • Ruohonen,K.(2009).F​ormallanguages.​RetrievedonDecember7,
  • 2015, from h​ttp://math.tut.fi/~ruohonen/FL.pdf.​
  • Salomaa, A. 1966. Two complete axiom systems for the algebra of regular
  • events. J​. ACM.​13(1):158­169.
  • Searls, D. 1993. The computational linguistics of biological sequences. In Artificial Intelligence and Molecular Biology.​L. Hunter (ed.), MIT Press, 1993, pp. 47­120.
  • Wood, D. 1987. Theory of Computation. Harper and Row.

 

 

Copyright 2009, Autores y colaboradores. Reconocer autoría/Citar obra. admin. (2015, October 08). Bibliografia. Retrieved September 23, 2017, from OCW Universidad de Málaga Web site: http://ocw.uma.es/ingenierias/teoria-de-automatas-y-lenguajes-formales/miasignaturaocw/bibliografia. Esta obra se publica bajo una licencia Licencia Creative Commons Licencia Creative Commons
« Septiembre 2017 »
Septiembre
LuMaMiJuViDo
123
45678910
11121314151617
18192021222324
252627282930