The following pages link to (Q4381391):
Displayed 20 items.
- A gap property of deterministic tree languages. (Q1401364) (← links)
- Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
- \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\) (Q2011666) (← links)
- Automata on infinite trees (Q2074210) (← links)
- Multi-player games with LDL goals over finite traces (Q2225596) (← links)
- Relating word and tree automata (Q2576943) (← links)
- Unambiguous Büchi Is Weak (Q2817398) (← links)
- On the Weak Index Problem for Game Automata (Q2947463) (← links)
- On Synthesis of Specifications with Arithmetic (Q3297765) (← links)
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (Q3519517) (← links)
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (Q3644751) (← links)
- (Q5014447) (← links)
- (Q5021013) (← links)
- How Deterministic are Good-For-Games Automata? (Q5136308) (← links)
- Sensing as a Complexity Measure (Q5205034) (← links)
- (Q5232903) (← links)
- Index Problems for Game Automata (Q5278187) (← links)
- On the power of finite ambiguity in Büchi complementation (Q6040669) (← links)
- Minimization of automata for liveness languages (Q6160912) (← links)
- Semantic flowers for good-for-games and deterministic automata (Q6195342) (← links)