Delay Games with WMSO+U Winning Conditions
From MaRDI portal
Publication:2953690
DOI10.1051/ita/2016018zbMath1356.68138arXiv1412.3978OpenAlexW2530653662MaRDI QIDQ2953690
Publication date: 5 January 2017
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.3978
2-person games (91A05) Applications of game theory (91A80) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal bounds in parametric LTL games
- Parametric linear dynamic logic
- Weak MSO with the unbounding quantifier
- From liveness to promptness
- Degrees of Lookahead in Context-free Infinite Games
- The Wadge Hierarchy of Max-Regular Languages
- Finitary winning in ω-regular games
- Infinite Games and Uniformization
- Delay Games with WMSO$$+$$U Winning Conditions
- Rabin's uniformization problem
- Degrees of Lookahead in Regular Infinite Games
- MSO on the Infinite Binary Tree: Choice and Order
- Weak MSO+U with Path Quantifiers over Infinite Trees
- On the Decidability of MSO+U on Infinite Trees
- Computer Science Logic
- What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead
- Parity and Streett Games with Costs
- Solving Sequential Conditions by Finite-State Strategies
- How Much Lookahead is Needed to Win Infinite Games?
This page was built for publication: Delay Games with WMSO+U Winning Conditions