Myhill–nerode relations on automatic systems and the completeness of Kleene Algebra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2010, Issue , 2001, Pages 27-38

  Kozen, Dexter ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTOMATIC SYSTEMS; INFINITE STATE; INFINITE SYSTEM; KLEENE ALGEBRAS; SPECIAL CLASS; SQUARE MATRICES;

MATRIX ALGEBRA;

EID: 26844534887     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_3     Document Type: Conference Paper

References (20)

1. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1975.
2. Roland Carl Backhouse. Closure Algorithms and the Star-Height Problem of Regular Languages. PhD thesis, Imperial College, London, U.K., 1975.
3. Janusz A. Brzozowski. Derivatives of regular expressions. J. Assoc. Comput.Mach., 11:481–494, 1964.
4. John Horton Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.
5. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
6. Kazuo Iwano and Kenneth Steiglitz. A semiring on convex polygons and zero-sum cycle problems. SIAM J. Comput., 19(5):883–901, 1990.
7. Stephen C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 3–41. Princeton University Press, Princeton, N.J., 1956.
8. Dexter Kozen. On induction vs. *-continuity. In Kozen, editor, Proc. Workshop on Logic of Programs, volume 131 of Lecture Notes in Computer Science, pages 167–176, New York, 1981. Springer-Verlag.
9. Dexter Kozen. The Design and Analysis of Algorithms. Springer-Verlag, New York, 1991.
10. Dexter Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Infor. and Comput., 110(2):366–390, May 1994.
11. Dexter Kozen. Kleene algebra with tests and commutativity conditions. In T. Margaria and B. Steffen, editors, Proc. Second Int. Workshop Tools and Algorithms for the Construction and Analysis of Systems (TACAS’96), volume 1055 of Lecture Notes in Computer Science, pages 14–33, Passau, Germany, March 1996. Springer-Verlag.
12. Dexter Kozen. Automata and Computability. Springer-Verlag, New York, 1997.
13. Dexter Kozen. Typed Kleene algebra. Technical Report 98-1669, Computer Science Department, Cornell University, March 1998.
14. Werner Kuich. The Kleene and Parikh theorem in complete semirings. In T. Ottmann, editor, Proc. 14th Colloq. Automata, Languages, and Programming, volume 267 of Lecture Notes in Computer Science, pages 212–225, New York, 1987. EATCS, Springer-Verlag.
15. Werner Kuich and Arto Salomaa. Semirings, Automata, and Languages. Springer-Verlag, Berlin, 1986.
16. K. C. Ng. Relation Algebras with Transitive Closure. PhD thesis, University of California, Berkeley, 1984.
17. Vaughan Pratt. Dynamic algebras as a well-behaved fragment of relation algebras. In D. Pigozzi, editor, Proc. Conf. on Algebra and Computer Science, volume 425 of Lecture Notes in Computer Science, pages 77–110, Ames, Iowa, June 1988. Springer-Verlag.
18. V. N. Redko. On defining relations for the algebra of regular events. Ukrain. Mat. Z., 16:120–126, 1964. In Russian.
19. Arto Salomaa. Two complete axiom systems for the algebra of regular events. J. Assoc. Comput. Mach., 13(1):158–169, January 1966.
20. Alfred Tarski. On the calculus of relations. J. Symb. Logic, 6(3):65–106, 1941.