next up previous contents
Un nivel arriba: PRINCIPIOS DE AUTOMATAS FINITOS Anterior: Programas

Bibliography

1
Aho, Ullman: Foundations of computer science, W. H. Freeman & Co., 1992

2
Anderson, Turing et al: Mentes y máquinas, en la colección Problemas científicos y filosóficos, Universidad Nacional Autónoma de México, 1970

3
Arbib: The algebraic theory of machines, languages and semigrups, Academic Press, 1968

4
Arbib, Kfoury, Moll: A basis for theoretical computer science, Springer-Verlag, 1981

5
Brzozowski: Derivates of Regular Expression, Journal of the ACM, 11, 1964

6
Bucher, Hagauer: It is decidable whether a regular language is pure context-free, TCS: Theoretical Computer Science, 26, 1983

7
Conway: Regular algebra and finite machines, Chapman & Hall, 1971

8
Crochemore, Rytter: Text algorithms, Oxford University Press, 1994

9
Davis: The undecidable, Raven Press, 1965

10
Denning, Dennis, Qualitz: Machines, languages and computation, Prentice-Hall, 1978

11
Eilenberg: Automata, languages, and machines, Volume A, Academic Press, 1974

12
Ginzburg: Algebraic theory of automata, Academic Press, 1968

13
Harrison: Introduction to switching and automata theory, McGraw-Hill Book company, 1965

14
Harrison: Introduction to formal languages theory, Addison Wesley, 1978

15
Hofstadter: Gödel, Escher, Bach: An eternal golden braid, Vintage Books, 1980

16
Hopcroft, Ullman: Introduction to automata theory, languages and computation, Addison-Wesley, 1979

17
Iwama: ASPACE is regular, SIAM Journal on Computing, 22, 1993

18
Kalmár: An argument against the plaussibility of Church's thesis, in Heyting (ed.) Constructivity in matematics: Proceedings of the colloquium held in Amsterdam, 1957 , North-Holland, 1959

19
Kfoury, Moll, Arbib: A programming approach to computability, Springer-Verlag, 1982

20
Kohavi: Switching and finite automata theory, McGraw-Hill, 1979

21
Kozen: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110 (2), 1994

22
Kuich, Salomaa: Semirings, automata, languages, Springer-Verlag, 1985

23
Lewis, Papadimitiou: Elements of the theory of computation, Prentice Hall, 1981

24
Lindgren, Nilsson, Nordahl, Räde: Regular language inference using evolving neural networks, in Whitley, Schaffer (ed's), Proceedings of COGANN-92 International Workshop on Combinations of Genetic Algorithms and Neural Networks, IEEE Computer Society Press, 1992

25
Minsky: Computation finite and infinite machines, Prentice Hall, Englewood Cliffs, 1967

26
Penrose: The emperor's new mind: Concerning computers, minds and the laws of physics, Oxford University Press, 1989

27
Ponty, Ziadi, Champarnaud: A new quadratic algorithm to convert a regular expression into an automaton, in Raymond, Wood, Yu (ed's) Automata implementation, Lecture Notes in Computer Science, 1260, 1997

28
Pospielov: Teoría de juegos y autómatas, Siglo XXI, 1969

29
Rogers: Theory of recursive functions and effective computability, McGraw-Hill, 1967

30
Rosenblueth: Mente y cerebro: Una filosofía de la ciencia, Siglo XXI, 1970

31
Ross: Animating finite state automata: Having fun with theory, SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory), 28, 1997

32
Rytter: 100 execises in the theory of automata and formal languages, Research report 99, Dept. Comp. Sci., University of Warwick, 1987

33
Salomaa: Automata theory, Pergamon Press, 1969

34
Salomaa: Formal languages, Academic Press, 1973

35
Shanon, McCarthy (ed's): Automata studies, Princeton University Press, 1956

36
Takada: A hierarchy of language families learnable by regular language learners, Lecture Notes in Computer Science, 862, 1994

37
Trajtenbrot: Introducción a la teoría matemática de las computadoras y de la programación, Siglo XXI, 1967


Guillermo Morales-Luna
2000-06-27