Pages that link to "Item:Q3347321"
From MaRDI portal
The following pages link to An application of the Ehrenfeucht-Fraisse game in formal language theory (Q3347321):
Displaying 18 items.
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Classifying regular languages by a split game (Q1022599) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- Games, equations and dot-depth two monoids (Q1201097) (← links)
- Trees, congruences and varieties of finite semigroups (Q1270818) (← 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)
- Games, equations and the dot-depth hierarchy (Q1823928) (← links)
- Inclusion relations between some congruences related to the dot-depth hierarchy (Q1917345) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
- Languages of dot-depth 3/2 (Q2480745) (← links)
- On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids (Q3126014) (← links)
- A conjecture on the concatenation product (Q3147025) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- The product of rational languages (Q4630281) (← links)
- On the Ehrenfeucht-Fraïssé game in theoretical computer science (Q5044763) (← links)
- On dot-depth two (Q5750405) (← links)