Decidability of Identity-free Relational Kleene Lattices - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Decidability of Identity-free Relational Kleene Lattices


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 intersection—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.
Fichier principal
Vignette du fichier
jfla15_submission_30.pdf (538.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01099137 , version 1 (31-12-2014)


  • HAL Id : hal-01099137 , version 1


Paul Brunet, Damien Pous. Decidability of Identity-free Relational Kleene Lattices. Vingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015), Jan 2015, Le Val d'Ajol, France. ⟨hal-01099137⟩
118 View
52 Download


Gmail Facebook X LinkedIn More