A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
ACM Transactions on Programming Languages and Systems (TOPLAS)
On Kleene Algebras and Closed Semirings
MFCS '90 Proceedings of the Mathematical Foundations of Computer Science 1990
Kleene Algebra with Tests: Completeness and Decidability
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Hi-index | 0.00 |
This paper proposes a framework for Kleene algebras with embedded structures that enables different kinds of Kleene algebras such as a Kleene algebra with tests and a Kleene algebra with relations to be handled uniformly. This framework guarantees the existence of free algebra if the embedded structures satisfy certain conditions.