Equations and dot-depth one

DOI10.1007/BF02573768zbMath0814.20048MaRDI QIDQ688972

Francine Blanchet-Sadri

Publication date: 13 June 1995

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/135281

zbMATH Keywords

star-free languages; finitely based varieties; finite monoid varieties; sequence of equations; Straubing hierarchy

Mathematics Subject Classification ID

68Q45: Formal languages and automata

20M07: Varieties and pseudovarieties of semigroups

20M05: Free semigroups, generators and relations, word problems

20M35: Semigroups in automata theory, linguistics, etc.

Related Items

REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT, Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$, Equations and monoid varieties of dot-depth one and two, Equations on the semidirect product of a finite semilattice by a finite commutative monoid, Polynomial closure and unambiguous product, Inclusion relations between some congruences related to the dot-depth hierarchy, On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classifying regular events in symbolic logic
• Games, equations and dot-depth two monoids
• The dot-depth hierarchy of star-free languages is infinite
• Games, equations and the dot-depth hierarchy
• Finite semigroup varieties of the form V*D
• Dot-depth of star-free events
• Characterizations of locally testable events
• On finite monoids having only trivial subgroups
• On dot-depth two