Games, equations and dot-depth two monoids
From MaRDI portal
Publication:1201097
DOI10.1016/0166-218X(92)90161-3zbMATH Open0791.20068MaRDI QIDQ1201097FDOQ1201097
Authors: F. Blanchet-Sadri
Publication date: 17 January 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Characterizations of locally testable events
- Title not available (Why is that?)
- An application of games to the completeness problem for formalized theories
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- Classifying regular events in symbolic logic
- Title not available (Why is that?)
- First-order logic and star-free sets
- A generalization of the Schützenberger product of finite monoids
- Finite semigroup varieties of the form V*D
- Dot-depth of star-free events
- Title not available (Why is that?)
- $ℵ_0$-categoricity of linear orderings
- Title not available (Why is that?)
- Categories as algebra: An essential ingredient in the theory of monoids
- Games, equations and the dot-depth hierarchy
- Title not available (Why is that?)
- The dot-depth hierarchy of star-free languages is infinite
- Title not available (Why is that?)
- On dot-depth two
- An application of the Ehrenfeucht-Fraisse game in formal language theory
- Some logical characterizations of the dot-depth hierarchy and applications
Cited In (10)
- 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
- 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
- Games, equations and the dot-depth hierarchy
- On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids
- Equations and dot-depth one
- Some logical characterizations of the dot-depth hierarchy and applications
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)