Closure properties and descriptional complexity of deterministic regular expressions
Theor. Comput. Sci., Volume 627, 2016, Pages 54-70.
We study the descriptional complexity of regular languages that are definable by deterministic regular expressions, i.e., we examine worst-case blow-ups in size when translating between different representations for such languages. As representations of languages, we consider regular expressions, deterministic regular expressions, and det...More
Full Text (Upload PDF)
PPT (Upload PPT)