Decidability of Identity-free Relational Kleene Lattices

Abstract : 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.
Type de document :
Rapport
2014
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01073932
Contributeur : Damien Pous <>
Soumis le : vendredi 10 octobre 2014 - 17:26:56
Dernière modification le : vendredi 16 septembre 2016 - 15:16:56
Document(s) archivé(s) le : dimanche 11 janvier 2015 - 11:20:11

Fichier

rklm.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01073932, version 1

Collections

Citation

Paul Brunet, Damien Pous. Decidability of Identity-free Relational Kleene Lattices. 2014. 〈hal-01073932〉

Partager

Métriques

Consultations de
la notice

113

Téléchargements du document

150