A completeness theorem for Kleene algebras and the algebra of regular events

@article{Kozen1991ACT,
  title={A completeness theorem for Kleene algebras and the algebra of regular events},
  author={D. Kozen},
  journal={[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science},
  year={1991},
  pages={214-225}
}
  • D. Kozen
  • Published 1991
  • Computer Science
  • [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
  • 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… CONTINUE READING
    48 Citations

    Topics from this paper.

    The Complexity of Kleene Algebra with Tests
    • 57
    • PDF
    Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
    • 61
    • PDF
    Modal Kleene Algebra and Partial Correctness
    • 23
    • PDF
    The Algebra of Finite State Processes
    • 8
    • PDF
    Equational Properties of Kleene Algebras of Relations with Conversion
    • 29
    Equational Axioms of Test Algebra
    • 14
    • PDF
    Kleene modules and linear languages
    • Hans Leiß
    • Mathematics, Computer Science
    • J. Log. Algebraic Methods Program.
    • 2006
    • 19
    • PDF
    Omega Algebra, Demonic Refinement Algebra and Commands
    • 20
    • PDF
    On the Complexity of the Equational Theory of Relational Action Algebras
    • 8
    • Highly Influenced
    • PDF
    An Infinitary Sequent System for the Equational Theory of *-continuous Action Lattices
    • E. Palka
    • Mathematics, Computer Science
    • Fundam. Informaticae
    • 2007
    • 24