THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE (Q4032922)

From MaRDI portal
Revision as of 21:26, 19 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q591667)
scientific article
Language Label Description Also known as
English
THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE
scientific article

    Statements

    THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE (English)
    0 references
    16 May 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    regular language
    0 references
    syntactic monoid
    0 references
    dot-depth hierarchy
    0 references
    star-free languages
    0 references
    varieties of finite monoids
    0 references
    semantic games
    0 references