Skip to Main content Skip to Navigation
Conference papers

Reversible Kleene lattices

Abstract : We investigate the equational theory of reversible Kleene lattices, that is algebras of languages with the regular operations (union, composition and Kleene star), together with the intersection and mirror image. Building on results by Andréka, Mikulás and Németi from 2011, we construct the free representation of this algebra. We then provide an automaton model to compare representations. These automata are adapted from Petri automata, which we introduced with Pous in 2015 to tackle a similar problem for algebras of binary relations. This allows us to show that testing the validity of equations in this algebra is decidable, and in fact ExpSpace-complete.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01474911
Contributor : Paul Brunet <>
Submitted on : Wednesday, June 21, 2017 - 1:02:48 PM
Last modification on : Saturday, January 5, 2019 - 1:09:27 AM
Document(s) archivé(s) le : Saturday, December 16, 2017 - 1:57:23 AM

File

mfcs.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Paul Brunet. Reversible Kleene lattices. 42nd International Symposium on Mathematical Foundations of Computer Science, Kim G. Larsen, Aug 2017, Aalborg, Denmark. pp.66:1--66:14, ⟨10.4230/LIPIcs.MFCS.2017.66⟩. ⟨hal-01474911v3⟩

Share

Metrics

Record views

83

Files downloads

57