Determinization and memoryless winning strategies
From MaRDI portal
Publication:1357005
Recommendations
- Determinization and Complementation of Streett Automata
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Progress measures, immediate determinacy, and a subset construction for tree automata
Cites work
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3990873 (Why is no real title available?)
- Alternating automata on infinite trees
- Borel determinacy
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Deciding full branching time logic
- Decision procedures and expressiveness in the temporal logic of branching time
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Solving Sequential Conditions by Finite-State Strategies
- State-strategies for games in Fσδ ∩ Gδσ
- Testing and generating infinite sequences by a finite automaton
- The Complexity of Tree Automata and Logics of Programs
Cited in
(8)- scientific article; zbMATH DE number 6486247 (Why is no real title available?)
- Synthesis of finite-state and definable winning strategies
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Determinancy with Complicated Strategies
- Monoidal-closed categories of tree automata
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
- Time-aware uniformization of winning strategies
- Memoryless determinacy of finite parity games: another simple proof
This page was built for publication: Determinization and memoryless winning strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357005)
