Descriptional complexity of deterministic regular expressions

    MFCS, pp. 643-654, 2012.

    Cited by: 9|Bibtex|Views5|Links
    EI
    Keywords:
    deterministic regular expressionequivalent deterministic expressionclosure propertydeterministic automatondescriptional complexityMore(5+)

    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 var...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments