A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events

A finitary axiomatization of the algebra of regular events involving only equations and equational implications that is sound for all interpretations over Kleene algebras is given. Axioms for Kleene algebra are presented, and some basic consequences are derived. Matrices over a Kleene algebra are considered. The notion of an automaton over an arbitrary Kleen algebra is defined and used to derive the classical results of the theory of finite automata as a result of the axioms. The completeness of the axioms for the algebra of regular events is treated. Open problems are indicated. >

[1]  Arto Salomaa.  ALGEBRA OF REGULAR EXPRESSIONS , 1969 .

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  Daniel Krob,et al.  A Complete System of B-Rational Identities , 1990, ICALP.

[4]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , 1984, EATCS Monographs on Theoretical Computer Science.

[5]  Dexter Kozen,et al.  On Induction vs. *-Continuity , 1981, Logic of Programs.

[6]  Werner Kuich,et al.  The Kleene and the Parikh Theorem in Complete Semirings , 1987, ICALP.

[7]  Kan Ching Ng,et al.  Relation algebras with transitive closure , 1984 .

[8]  A. Selman.  Completeness of calculii for axiomatically defined classes of algebras , 1972 .

[9]  V N Redko,et al.  On the determinative aggregate of relationships of the algebra of regular events , 1964 .

[10]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[11]  Daniel Krob,et al.  Complete Systems of B-Rational Identities , 1991, Theor. Comput. Sci..

[12]  S. Safra.  On The Complexity of w-Automata , 1988 .

[13]  Arto Salomaa,et al.  Two Complete Axiom Systems for the Algebra of Regular Events , 1966, JACM.

[14]  Jacques Sakarovitch.  Kleene's theorem revisited , 1986, IMYCS.

[15]  Roland Carl Backhouse.  Closure algorithms and the star-height problem of regular languages , 1976 .

[16]  Kurt Mehlhorn,et al.  Graph Algorithm and NP-Completeness , 1984 .

[17]  Ferenc Gécseg,et al.  Algebraic theory of automata , 1972 .

[18]  Dexter Kozen,et al.  On Kleene Algebras and Closed Semirings , 1990, MFCS.

[19]  Vaughan R. Pratt,et al.  Dynamic algebras as a well-behaved fragment of relation algebras , 1988, Algebraic Logic and Universal Algebra in Computer Science.

[20]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[21]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[22]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[23]  Kenneth Steiglitz,et al.  A Semiring on Convex Polygons and Zero-Sum Cycle Problems , 1990, SIAM J. Comput..

[24]  Maurice Boffa,et al.  Une remarque sur les systèmes complets d'identités rationnelles , 1990, RAIRO Theor. Informatics Appl..

[25]  J. Conway.  Regular algebra and finite machines , 1971 .

[26]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[27]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[28]  Zoltán Ésik,et al.  Equational axioms for regular sets , 1993, Mathematical Structures in Computer Science.