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

DOI10.1142/S012905419200022XzbMath0776.68087OpenAlexW2090020000MaRDI QIDQ4032922

Francine Blanchet-Sadri

Publication date: 16 May 1993

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905419200022x

zbMATH Keywords

regular languagedot-depth hierarchystar-free languagessyntactic monoidvarieties of finite monoidssemantic games

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (3)

Inclusion relations between some congruences related to the dot-depth hierarchy ⋮ Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$ ⋮ On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids

This page was built for publication: THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE