The following pages link to (Q4381381):
Displayed 6 items.
- On the separation question for tree languages (Q2254515) (← links)
- The alternation hierarchy in fixpoint logic with chop is strict too (Q2509356) (← links)
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (Q3644751) (← links)
- Domain mu-calculus (Q4460689) (← links)
- The<i>μ</i>-calculus alternation-depth hierarchy is strict on binary trees (Q4943546) (← links)
- Fixpoint alternation: arithmetic, transition systems, and the binary tree (Q4943547) (← links)