The following pages link to Languages of dot-depth 3/2 (Q2480745):
Displaying 12 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words (Q832937) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Varieties (Q2074217) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- Concatenation hierarchies: new bottle, old wine (Q2399361) (← links)
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy (Q2411037) (← links)
- Theme and Variations on the Concatenation Product (Q3014930) (← links)
- AROUND DOT-DEPTH ONE (Q4923283) (← links)
- (Q4988163) (← links)
- (Q4989409) (← links)
- Forbidden Patterns for FO<sup>2</sup> Alternation Over Finite and Infinite Words (Q6169964) (← links)
