DocumentCode
2148070
Title
A completeness theorem for Kleene algebras and the algebra of regular events
Author
Kozen, Dexter
Author_Institution
Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
fYear
1991
fDate
15-18 July 1991
Firstpage
214
Lastpage
225
Abstract
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
Keywords
finite automata; formal logic; Kleene algebras; completeness theorem; finite automata; matrices; regular events; Algebra; Algorithm design and analysis; Automata; Books; Computer science; Equations; Formal languages; Logic design; Logic functions; Modular construction;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1991. LICS '91., Proceedings of Sixth Annual IEEE Symposium on
Conference_Location
Amsterdam
Print_ISBN
0-8186-2230-X
Type
conf
DOI
10.1109/LICS.1991.151646
Filename
151646
Link To Document