Some results on the dot-depth hierarchy

DOI10.1007/BF02573578zbMath0778.20025OpenAlexW2095131801MaRDI QIDQ1207707

Pascal Weil

Publication date: 16 May 1993

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

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

zbMATH Keywords

idempotentvariety of semigroupsaperiodic monoiddot-depthMal'cev productpseudo-variety of finite monoidsvariety of commutative idempotent monoids

Mathematics Subject Classification ID

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

Related Items (19)

Some complexity results for polynomial rational expressions. ⋮ POLYNOMIAL CLOSURE AND TOPOLOGY ⋮ INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY ⋮ PROFINITE METHODS IN SEMIGROUP THEORY ⋮ Polynomial closure and unambiguous product ⋮ Polynomial closure and unambiguous product ⋮ A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS ⋮ Finite state automata: A geometric approach ⋮ On the power pseudovariety \(\mathbf{PCS}\). ⋮ On non-commuting sets in finite soluble CC-groups. ⋮ Fragments of first-order logic over infinite words ⋮ On the lattice of sub-pseudovarieties of DA. ⋮ The globals of pseudovarieties of ordered semigroups containingB₂and an application to a problem proposed by Pin ⋮ Representations of relatively free profinite semigroups, irreducibility, and order primitivity ⋮ Logic, semigroups and automata on words ⋮ Unnamed Item ⋮ Algebraic tools for the concatenation product. ⋮ A conjecture on the concatenation product ⋮ The finite power property in free groups

Uses Software

• AUTOMATE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Categories as algebra: An essential ingredient in the theory of monoids
• On generalized locally testable languages
• The kernel of monoid morphisms
• A property of the Schützenberger product
• Locally trivial categories and unambiguous concatenation
• Semigroups and languages of dot-depth two
• Inverse monoids of dot-depth two
• A generalization of the Schützenberger product of finite monoids
• Classifying regular events in symbolic logic
• AUTOMATE, a computing package for automata and finite semigroups
• On a conjecture concerning dot-depth two languages
• The dot-depth hierarchy of star-free languages is infinite
• Sur le produit de concatenation non ambigu
• Finite semigroup varieties of the form V*D
• An interesting combinatorial method in the theory of locally finite semigroups
• Classification of noncounting events
• Finite monoids and the fine structure of NC ¹
• On finite monoids having only trivial subgroups

This page was built for publication: Some results on the dot-depth hierarchy