Descriptional complexity of deterministic regular expressions
MFCS, pp. 643-654, 2012.
deterministic regular expressionequivalent deterministic expressionclosure propertydeterministic automatondescriptional complexityMore(5+)
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 var...More
Full Text (Upload PDF)
PPT (Upload PPT)