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

DOI10.1142/S012905419200022XMaRDI QIDQ4032922zbMATH OpenOpenAlexFDO

Authors F. 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

dot-depth hierarchyregular languagesemantic gamesstar-free languagessyntactic monoidvarieties of finite monoids

Mathematics Subject Classification ID

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

Recommendations

• On dot-depth two
• INVERSE MONOIDS OF DOT-DEPTH TWO
• Games, equations and the dot-depth hierarchy
• The dot-depth hierarchy, 45 years later
• Some results on the dot-depth hierarchy

Cited in

(14)

• Games, equations and dot-depth two monoids
• Some results on the dot-depth hierarchy
• On a complete set of generators for dot-depth two
• Games, equations and the dot-depth hierarchy
• Inclusion relations between some congruences related to the dot-depth hierarchy
• Classifying regular languages via cascade products of automata
• On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids
• scientific article; zbMATH DE number 4049066 (Why is no real title available?)
• scientific article; zbMATH DE number 1254105 (Why is no real title available?)
• INVERSE MONOIDS OF DOT-DEPTH TWO
• scientific article; zbMATH DE number 2080228 (Why is no real title available?)
• Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$
• On dot-depth two
• Finite-automaton aperiodicity is PSPACE-complete

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032922)