Abstract
We study the descriptional complexity of regular languages that are definable by deterministic regular expressions. First, we examine possible blow-ups when translating between regular expressions, deterministic regular expressions, and deterministic automata. Then we give an overview of the closure properties of these languages under various language-theoretic operations and we study the descriptional complexity of applying these operations. Our main technical result is a general property that implies that the blow-up when translating a DFA to an equivalent deterministic expression can be exponential. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Losemann, K., Martens, W., & Niewerth, M. (2012). Descriptional complexity of deterministic regular expressions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7464 LNCS, pp. 643–654). https://doi.org/10.1007/978-3-642-32589-2_56
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
