Syntactic Complexity of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages (Q2843093)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Syntactic Complexity of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages
scientific article

    Statements

    Syntactic Complexity of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages (English)
    0 references
    0 references
    0 references
    9 August 2013
    0 references
    0 references
    finite automaton
    0 references
    \({\mathcal J}\)-trivial
    0 references
    monoid
    0 references
    regular language
    0 references
    \({\mathcal R}\)-trivial
    0 references
    semigroup
    0 references
    syntactic complexity
    0 references
    0 references
    0 references