On dot-depth two

DOI10.1051/ITA/1990240605211MaRDI QIDQ5750405zbMATH OpenOpenAlexFDO

Authors F. Blanchet-Sadri

Publication date 1990

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

dot-depthregular languagestar-freeStraubing hierarchy

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Hierarchies of computability and definability (03D55) Formal languages and automata (68Q45)

Recommendations

• Inverse monoids of dot-depth two
• THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE
• The dot-depth hierarchy, 45 years later
• INVERSE MONOIDS OF DOT-DEPTH TWO
• Some logical characterizations of the dot-depth hierarchy and applications

Cites work

• 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
• 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 3961008 (Why is no real title available?)
• scientific article; zbMATH DE number 4037246 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3767656 (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 3561239 (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?)
• scientific article; zbMATH DE number 3390700 (Why is no real title available?)
• On finite monoids having only trivial subgroups
• The dot-depth hierarchy of star-free languages is infinite

Cited in

(23)

• Semigroups and languages of dot-depth two
• Inverse monoids of dot-depth two
• On a conjecture concerning dot-depth two languages
• Games, equations and dot-depth two monoids
• 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
• 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
• A conjecture on the concatenation product
• scientific article; zbMATH DE number 3961008 (Why is no real title available?)
• THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE
• INVERSE MONOIDS OF DOT-DEPTH TWO
• scientific article; zbMATH DE number 2080228 (Why is no real title available?)
• Polynomial closure and unambiguous product
• The dot-depth hierarchy, 45 years later
• Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$
• New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages
• Around dot-depth one
• Equations and dot-depth one
• Dot-depth three, return of the j-class

This page was built for publication: On dot-depth two

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