Kleene Algebra with Converse - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Kleene Algebra with Converse


The equational theory generated by all algebras of binary relations with operations of union, composition, converse and reflexive transitive closure was studied by Bernátsky, Bloom, Ésik, and Stefanescu in 1995. We reformulate some of their proofs in syntactic and elementary terms, and we provide a new algorithm to decide the corresponding theory. This algorithm is both simpler and more efficient; it relies on an alternative automata construction, that allows us to prove that the considered equational theory lies in the complexity class PSPACE. Specific regular languages appear at various places in the proofs. Those proofs were made tractable by considering appropriate automata recognising those languages, and exploiting symmetries in those automata.
Fichier principal
Vignette du fichier
kac.pdf (605.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00938235 , version 1 (29-01-2014)


  • HAL Id : hal-00938235 , version 1


Paul Brunet, Damien Pous. Kleene Algebra with Converse. RAMiCS, Apr 2014, Marienstatt im Westerwald, Germany. pp.101-118. ⟨hal-00938235⟩
267 View
249 Download


Gmail Facebook Twitter LinkedIn More