Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
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.
Unable to display preview. Download preview PDF.
- 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.Roland Carl Backhouse. Closure Algorithms and the Star-Height Problem of Regular Lan-guages. PhD thesis, Imperial College, London, U.K., 1975.Google Scholar
- 4.John Horton Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.Google Scholar
- 5.J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Compu-tation. Addison-Wesley, 1979.Google Scholar
- 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
- 9.Dexter Kozen. The Design and Analysis of Algorithms. Springer-Verlag, New York, 1991.Google Scholar
- 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.Dexter Kozen. Automata and Computability. Springer-Verlag, New York, 1997.Google Scholar
- 13.Dexter Kozen. Typed Kleene algebra. Technical Report 98–1669, Computer Science Department, Cornell University, March 1998.Google Scholar
- 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.Werner Kuich and Arto Salomaa. Semirings, Automata, and Languages. Springer-Verlag, Berlin, 1986.Google Scholar
- 16.K. C. Ng. Relation Algebras with Transitive Closure. PhD thesis, University of California, Berkeley, 1984.Google Scholar
- 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