Closure properties and descriptional complexity of deterministic regular expressions (Q265078)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Closure properties and descriptional complexity of deterministic regular expressions
scientific article

    Statements

    Closure properties and descriptional complexity of deterministic regular expressions (English)
    0 references
    0 references
    0 references
    0 references
    1 April 2016
    0 references
    deterministic regular expressions
    0 references
    one-unambiguous languages
    0 references
    Boolean operations
    0 references
    automata theory
    0 references
    descriptional complexity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers