Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra

  • Dexter Kozen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2010)

Abstract

It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restric- tions. One can use this fact to solve certain infinite systems of inequalities over a Kleene algebra. Automatic systems are a special class of infinite systems that can be viewed as infinite-state automata. Automatic systems can be collapsed us- ing Myhill-Nerode relations in much the same way that finite automata can. The Brzozowski derivative on an algebra of polynomials over a Kleene algebra gives rise to a triangular automatic system that can be solved using these methods. This provides an alternative method for proving the completeness of Kleene algebra.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Com-puter Algorithms. Addison-Wesley, Reading, Mass., 1975.Google Scholar
  2. 2.
    Roland Carl Backhouse. Closure Algorithms and the Star-Height Problem of Regular Lan-guages. PhD thesis, Imperial College, London, U.K., 1975.Google Scholar
  3. 3.
    Janusz A. Brzozowski. Derivatives of regular expressions. J. Assoc. Comput. Mach., 11:481–494, 1964.MATHMathSciNetGoogle Scholar
  4. 4.
    John Horton Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.Google Scholar
  5. 5.
    J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Compu-tation. Addison-Wesley, 1979.Google Scholar
  6. 6.
    Kazuo Iwano and Kenneth Steiglitz. A semiring on convex polygons and zero-sum cycle problems. SIAM J. Comput., 19(5):883–901, 1990.MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Stephen C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shan-non and J. McCarthy, editors, Automata Studies, pages 3–41. Princeton University Press, Princeton, N.J., 1956.Google Scholar
  8. 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.CrossRefGoogle Scholar
  9. 9.
    Dexter Kozen. The Design and Analysis of Algorithms. Springer-Verlag, New York, 1991.Google Scholar
  10. 10.
    Dexter Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Infor. and Comput., 110(2):366–390, May 1994.MATHCrossRefMathSciNetGoogle Scholar
  11. 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.Google Scholar
  12. 12.
    Dexter Kozen. Automata and Computability. Springer-Verlag, New York, 1997.Google Scholar
  13. 13.
    Dexter Kozen. Typed Kleene algebra. Technical Report 98–1669, Computer Science Department, Cornell University, March 1998.Google Scholar
  14. 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.Google Scholar
  15. 15.
    Werner Kuich and Arto Salomaa. Semirings, Automata, and Languages. Springer-Verlag, Berlin, 1986.Google Scholar
  16. 16.
    K. C. Ng. Relation Algebras with Transitive Closure. PhD thesis, University of California, Berkeley, 1984.Google Scholar
  17. 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.Google Scholar
  18. 18.
    V. N. Redko. On defining relations for the algebra of regular events. Ukrain.Mat.Z., 16:120–126, 1964. In Russian.MathSciNetGoogle Scholar
  19. 19.
    Arto Salomaa. Two complete axiom systems for the algebra of regular events. J. Assoc. Comput. Mach., 13(1):158–169, January 1966.MATHMathSciNetGoogle Scholar
  20. 20.
    Alfred Tarski. On the calculus of relations. J. Symb. Logic, 6(3):65–106, 1941.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Dexter Kozen
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations