The following pages link to (Q4381381):
Displaying 22 items.
- The modal mu-calculus alternation hierarchy is strict (Q1276239) (← links)
- Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
- On the separation question for tree languages (Q2254515) (← links)
- The alternation hierarchy in fixpoint logic with chop is strict too (Q2509356) (← links)
- The alternation hierarchy for the theory of \(\mu\)-lattices (Q2770141) (← links)
- Unambiguous Büchi Is Weak (Q2817398) (← links)
- Full Hybrid μ-Calculus, Its Bisimulation Invariance and Application to Argumentation (Q2915051) (← links)
- Structural Refinement for the Modal nu-Calculus (Q2938159) (← links)
- Canonicity results for mu-calculi: an algorithmic approach (Q2983395) (← links)
- On the Modal μ-Calculus Over Finite Symmetric Graphs (Q3454725) (← links)
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (Q3644751) (← links)
- (Q4415259) (← links)
- Domain mu-calculus (Q4460689) (← links)
- On the Strength of Unambiguous Tree Automata (Q4683238) (← 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)
- (Q5002827) (← links)
- On the Way to Alternating Weak Automata (Q5090957) (← links)
- Index Problems for Game Automata (Q5278187) (← links)
- The modal mu-calculus alternation hierarchy is strict (Q6104376) (← links)
- The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames (Q6160744) (← links)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
