Pages that link to "Item:Q1823928"
From MaRDI portal
The following pages link to Games, equations and the dot-depth hierarchy (Q1823928):
Displaying 18 items.
- On the word problem for syntactic monoids of piecewise testable languages. (Q444643) (← links)
- The variable hierarchy for the games \(\mu \)-calculus (Q636308) (← links)
- Normal forms under Simon's congruence (Q667852) (← links)
- Equations and dot-depth one (Q688972) (← links)
- Games, equations and dot-depth two monoids (Q1201097) (← links)
- Equations and monoid varieties of dot-depth one and two (Q1314381) (← links)
- On a complete set of generators for dot-depth two (Q1324687) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages (Q1748357) (← links)
- Inclusion relations between some congruences related to the dot-depth hierarchy (Q1917345) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- Tropical representations and identities of the stylic monoid (Q2684013) (← links)
- On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids (Q3126014) (← links)
- Hierarchies of Piecewise Testable Languages (Q3533034) (← links)
- HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES (Q3586402) (← links)
- REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT (Q4658714) (← links)
- Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$ (Q4850322) (← links)
- On dot-depth two (Q5750405) (← links)
