Games, equations and dot-depth two monoids

DOI10.1016/0166-218X(92)90161-3MaRDI QIDQ1201097zbMATH OpenFDO

Authors F. Blanchet-Sadri

Publication date 17 January 1993

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

dot-depth hierarchyfree monoidsclass of congruencesEhrenfeucht- Fraisse game

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• Games, equations and the dot-depth hierarchy
• Some logical characterizations of the dot-depth hierarchy and applications
• On dot-depth two
• Inclusion relations between some congruences related to the dot-depth hierarchy
• THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE

Cites work

• 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?)
• $ℵ_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
• 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

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)