Some questions concerning the dot-depth hierarchy \({\mathcal V}_ k\) and its sub-hierarchies \({\mathcal V}_{k,m}\) are studied. The approach taken by the author is based on a class of congruences \(\sim \overline{m}\) defined on free monoids for every sequence \(\overline{m} = (m_ 1,\dots,m_ k)\) of positive integers. Such congruences arise from an extension of the standard Ehrenfeucht-Fraisse game due to W. Thomas. The author provides some systems of equations which are satisfied by \({\mathcal V}_{2,m}\), and for an alphabet \(A\) of cardinality at least two obtains, amongst other things, necessary and sufficient conditions for \(A^*/\sim (m_ 1,\dots,m_ k)\) to be of dot-depth exactly 2.
- ℵ_0-categoricity of linear orderings
- A generalization of the Schützenberger product of finite monoids
- An application of games to the completeness problem for formalized theories
- An application of the Ehrenfeucht-Fraisse game in formal language theory
- Categories as algebra: An essential ingredient in the theory of monoids
- Characterizations of locally testable events
- Classifying regular events in symbolic logic
- Dot-depth of star-free events
- Finite semigroup varieties of the form V*D
- First-order logic and star-free sets
- Games, equations and the dot-depth hierarchy
- scientific article; zbMATH DE number 3827223 (Why is no real title available?)
- scientific article; zbMATH DE number 3961008 (Why is no real title available?)
- scientific article; zbMATH DE number 4037246 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 3892608 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- On dot-depth two
- On finite monoids having only trivial subgroups
- Some logical characterizations of the dot-depth hierarchy and applications
- The dot-depth hierarchy of star-free languages is infinite
- Trees, congruences and varieties of finite semigroups
- Equations and monoid varieties of dot-depth one and two
- On a complete set of generators for dot-depth two
- Polynomial closure and unambiguous product
- On a product of finite monoids
- Games, equations and the dot-depth hierarchy
- Some logical characterizations of the dot-depth hierarchy and applications
- Inclusion relations between some congruences related to the dot-depth hierarchy
- On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids
- Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$
- Equations and dot-depth one
This page was built for publication: Games, equations and dot-depth two monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201097)
