Inclusion relations between some congruences related to the dot-depth hierarchy
From MaRDI portal
Publication:1917345
DOI10.1016/0166-218X(95)00047-UzbMath0854.68051OpenAlexW1997564211MaRDI QIDQ1917345
Publication date: 7 July 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(95)00047-u
Related Items (2)
Trees, congruences and varieties of finite semigroups ⋮ 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
- Unnamed Item
- Categories as algebra: An essential ingredient in the theory of monoids
- Equations and dot-depth one
- First-order logic and star-free sets
- A property of the Schützenberger product
- Inverse monoids of dot-depth two
- Classifying regular events in symbolic logic
- Games, equations and dot-depth two monoids
- The dot-depth hierarchy of star-free languages is infinite
- Equations and monoid varieties of dot-depth one and two
- On a complete set of generators for dot-depth two
- Games, equations and the dot-depth hierarchy
- Some logical characterizations of the dot-depth hierarchy and applications
- Finite semigroup varieties of the form V*D
- Dot-depth of star-free events
- Weak Second‐Order Arithmetic and Finite Automata
- An application of the Ehrenfeucht-Fraisse game in formal language theory
- Decision Problems of Finite Automata Design and Related Arithmetics
- THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE
- Application of model theoretic games to discrete linear orders and finite automata
- Algebraic decision procedures for local testability
- On finite monoids having only trivial subgroups
- On dot-depth two
This page was built for publication: Inclusion relations between some congruences related to the dot-depth hierarchy
