Decidability of Identity-free Relational Kleene Lattices

Paul Brunet (1, 2) , Damien Pous (1, 2)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 PLUME - Preuves et Langages

Families of binary relations are important interpretations of regular expressions, and the equivalence of two regular expressions with respect to their relational interpretations is decidable: the problem reduces to the equality of the denoted regular languages. Putting together a few results from the literature, we first make explicit a generalisation of this reduction, for regular expressions extended with converse and intersection: instead of considering sets of words (i.e., formal languages), one has to consider sets of directed and labelled graphs. We then focus on identity-free regular expressions with converse---a setting where the above graphs are acyclic---and we show that the corresponding equational theory is decidable. We achieve this by defining an automaton model, based on Petri Nets, to recognise these sets of acyclic graphs, and by providing an algorithm to compare such automata.

Mots clés: regular expression; meet; Petri net; decidability; coinduction; Kleene lattice; Automata

Domaines: Logique en informatique [cs.LO]

Paul Brunet, Damien Pous. Decidability of Identity-free Relational Kleene Lattices. [Research Report] ENS de Lyon. 2014. ⟨hal-01073932⟩