Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4951154 | Journal of Computer and System Sciences | 2017 | 15 Pages |
Abstract
We investigate the complexity of deciding whether a given regular language can be expressed by a deterministic regular expression. Our main technical result shows that deciding if the language of a given regular expression (or, non-deterministic finite automaton) can be defined by a deterministic regular expression is PSPACE-complete. The problem becomes EXPSPACE-complete if the input language is represented as a regular expression with counters and NL-hard if the input language is given by a minimal deterministic finite automaton.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Wojciech CzerwiÅski, Claire David, Katja Losemann, Wim Martens,