Separating without any ambiguity - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Separating without any ambiguity

Résumé

We investigate a standard operator on classes of languages: unambiguous polynomial closure. We show that if C is a class of regular languages having some mild properties, the membership problem for its unambiguous polynomial closure UPol(C) reduces to the same problem for C. We give a new, self-contained and elementary proof of this result. We also show that unambiguous polynomial closure coincides with alternating left and right deterministic closure. Finally, if additionally C is finite, we show that the separation and covering problems are decidable for UPol(C).
Fichier principal
Vignette du fichier
upol.pdf (757.91 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01798847 , version 1 (24-05-2018)

Identifiants

Citer

Thomas Place, Marc Zeitoun. Separating without any ambiguity. 45th International Colloquium on Automata, Languages and Programming, ICALP 2018, Jul 2018, Prague, Czech Republic. ⟨10.4230/LIPIcs.ICALP.2018⟩. ⟨hal-01798847⟩

Collections

CNRS
80 Consultations
40 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More