Deciding definability by deterministic regular expressions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Computer and System Sciences Année : 2017

Deciding definability by deterministic regular expressions

Résumé

We investigate the complexity of deciding whether a given regular language can be defined with a deterministic regular expression. Our main technical result shows that the problem is Pspace-complete if the input language is represented as a regular expression or nondeterministic finite automaton. The problem becomes Expspace-complete if the language is represented as a regular expression with counters.
Fichier principal
Vignette du fichier
jcss-dre.pdf (343.4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01806706 , version 1 (04-06-2018)

Identifiants

Citer

Wojciech Czerwiński, Claire David, Katja Losemann, Wim Martens. Deciding definability by deterministic regular expressions. Journal of Computer and System Sciences, 2017, 88, pp.75-89. ⟨10.1016/j.jcss.2017.03.011⟩. ⟨hal-01806706⟩
255 Consultations
200 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More