Equations defining the polynomial closure of a lattice of regular languages - Archive ouverte HAL
Communication Dans Un Congrès Année : 2009

Equations defining the polynomial closure of a lattice of regular languages

Résumé

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.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
PolClosureICALP.pdf (173.54 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00423494 , version 1 (11-10-2009)

Identifiants

  • HAL Id : hal-00423494 , version 1

Citer

Mário Branco, Jean-Eric Pin. Equations defining the polynomial closure of a lattice of regular languages. ICALP 2009, Jul 2009, Rhodes, Grèce, France. pp.115 - 126. ⟨hal-00423494⟩
88 Consultations
100 Téléchargements

Partager

More