Complexity of Suffix-Free Regular Languages (Q2947876)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of Suffix-Free Regular Languages
scientific article

    Statements

    Complexity of Suffix-Free Regular Languages (English)
    0 references
    0 references
    0 references
    29 September 2015
    0 references
    0 references
    most complex
    0 references
    regular language
    0 references
    state complexity
    0 references
    suffix-free
    0 references
    syntactic complexity
    0 references
    transition semigroup
    0 references
    0 references