scientific article
From MaRDI portal
Publication:3384169
zbMath1484.91014MaRDI QIDQ3384169
Publication date: 14 December 2021
Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2017.11
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Finite-state strategies in delay games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak MSO with the unbounding quantifier
- Borel determinacy
- Infinite games played on finite graphs
- Pushdown processes: Games and model-checking
- Automata, logics, and infinite games. A guide to current research
- Degrees of Lookahead in Context-free Infinite Games
- Synthesis of Finite-state and Definable Winning Strategies.
- Delay Games with WMSO+U Winning Conditions
- Playing Safe
- The Complexity of Request-Response Games
- Degrees of Lookahead in Regular Infinite Games
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
- Deciding parity games in quasipolynomial time
- What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead
- Solving Sequential Conditions by Finite-State Strategies
- Decidability of Second-Order Theories and Automata on Infinite Trees
- How Much Lookahead is Needed to Win Infinite Games?
This page was built for publication:
