Determinization and memoryless winning strategies
From MaRDI portal
Publication:1357005
DOI10.1006/INCO.1997.2624zbMATH Open0887.68071OpenAlexW1968847402MaRDI QIDQ1357005FDOQ1357005
Authors: C. S. Jutla 
Publication date: 16 June 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1997.2624
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
- Borel determinacy
- Decidability of Second-Order Theories and Automata on Infinite Trees
- The Complexity of Tree Automata and Logics of Programs
- Title not available (Why is that?)
- Decision procedures and expressiveness in the temporal logic of branching time
- Title not available (Why is that?)
- Alternating automata on infinite trees
- Testing and generating infinite sequences by a finite automaton
- Deciding full branching time logic
- State-strategies for games in Fσδ ∩ Gδσ
- Solving Sequential Conditions by Finite-State Strategies
- Progress measures, immediate determinacy, and a subset construction for tree automata
Cited In (8)
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
- Time-aware uniformization of winning strategies
- Monoidal-closed categories of tree automata
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Title not available (Why is that?)
- Determinancy with Complicated Strategies
- Memoryless determinacy of finite parity games: another simple proof
- Synthesis of finite-state and definable winning strategies
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)
