Games, equations and the dot-depth hierarchy
From MaRDI portal
Recommendations
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 3654376 (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?)
- $ℵ_0$-categoricity of linear orderings
- Algebraic decision procedures for local testability
- An application of games to the completeness problem for formalized theories
- An application of the Ehrenfeucht-Fraisse game in formal language theory
- Application of model theoretic games to discrete linear orders and finite automata
- 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
- On finite monoids having only trivial subgroups
- The dot-depth hierarchy of star-free languages is infinite
Cited in
(20)- On dot-depth two
- REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT
- On a complete set of generators for dot-depth two
- On Boolean combinations forming piecewise testable languages
- Tropical representations and identities of the stylic monoid
- THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE
- Inclusion relations between some congruences related to the dot-depth hierarchy
- Equations and monoid varieties of dot-depth one and two
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
- On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids
- On the word problem for syntactic monoids of piecewise testable languages.
- Normal forms under Simon's congruence
- Hierarchies of Piecewise Testable Languages
- Equations and dot-depth one
- Polynomial closure and unambiguous product
- scientific article; zbMATH DE number 4049066 (Why is no real title available?)
- Hierarchies of piecewise testable languages
- Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$
- The variable hierarchy for the games \(\mu \)-calculus
- Games, equations and dot-depth two monoids
This page was built for publication: Games, equations and the dot-depth hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823928)
