 |
|
|
|
| HAL : hal-00423494, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| ICALP 2009, Rhodes, Grèce : France (2009) |
|
|
|
|
| Equations defining the polynomial closure of a lattice of regular languages |
|
|
| Mário Branco 1Jean-Eric Pin 2 |
|
|
| Projet AutoMathA de l'European Science Foundation Collaboration(s) |
|
|
| (06/07/2009) |
|
|
|
| The polynomial closure of a class of languages C is the set of languages that are finite unions of languages of the form L0a1L1... anLn, where the ai's are letters and the Li's are elements of C. The main result of this paper gives an equational description of the polynomial closure of C, given an equational description of C, when C is a lattice of regular languages closed under quotients. As an application of this result, we give a set of equations defining the polynomial closure of the languages of the form u* or A*, where u is a word, and we use these equations to show that this class is decidable. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Centro de Álgebra da Universidade de Lisboa (CAUL) |
|
|
|
Universidade de Lisboa |
|
|
| 2 : | Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA) |
|
|
|
CNRS : UMR7089 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Automates et applications |
|
|
|
|
| Domaine | : | Informatique/Autre |
|
|
| Equational theory – regular language – polynomial closure |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00423494, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00423494 | |
| oai:hal.archives-ouvertes.fr:hal-00423494 | |
| Contributeur : Jean-Eric Pin | |
| Soumis le : Dimanche 11 Octobre 2009, 11:52:06 | |
| Dernière modification le : Dimanche 11 Octobre 2009, 18:43:04 | |
