Delay Games with WMSO$$+$$U Winning Conditions
From MaRDI portal
Publication:3194731
DOI10.1007/978-3-319-20297-6_26zbMath1356.68137OpenAlexW1908845516MaRDI QIDQ3194731
Publication date: 20 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-20297-6_26
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 (4)
Delay Games with WMSO$$+$$U Winning Conditions ⋮ Delay Games with WMSO+U Winning Conditions ⋮ How Much Lookahead is Needed to Win Infinite Games? ⋮ How Much Lookahead is Needed to Win Infinite Games?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal bounds in parametric LTL games
- Weak MSO with the unbounding quantifier
- From liveness to promptness
- Borel determinacy
- Automata, logics, and infinite games. A guide to current research
- Degrees of Lookahead in Context-free Infinite Games
- Finitary winning in ω-regular games
- Infinite Games and Uniformization
- Degrees of Lookahead in Regular Infinite Games
- Delay Games with WMSO$$+$$U Winning Conditions
- Rabin's uniformization problem
- 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
- 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
