Deciding Definability by Deterministic Regular Expressions

Wojciech Czerwiński (1) , Claire David (2) , Katja Losemann (1) , Wim Martens (1)

1 Universität Bayreuth
2 LIGM - Laboratoire d'Informatique Gaspard-Monge

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.

Domaines: Théorie et langage formel [cs.FL]

Wojciech Czerwiński, Claire David, Katja Losemann, Wim Martens. Deciding Definability by Deterministic Regular Expressions. Foundations of Software Science and Computation Structure (FoSSaCS'13), 2013, Italy. pp.16. ⟨hal-00788609⟩