THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE
From MaRDI portal
Publication:4032922
DOI10.1142/S012905419200022XzbMath0776.68087MaRDI QIDQ4032922
Publication date: 16 May 1993
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
regular language; dot-depth hierarchy; star-free languages; syntactic monoid; varieties of finite monoids; semantic games
68Q45: Formal languages and automata
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$, Inclusion relations between some congruences related to the dot-depth hierarchy, On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids