How Much Lookahead is Needed to Win Infinite Games?

DOI10.2168/LMCS-12(3:4)2016zbMath1440.68126MaRDI QIDQ5892380

Felix Klein, Martín G. Zimmermann

Publication date: 11 April 2017

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

delayinfinite games\(\omega\)-regular languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic game theory and complexity (91A68)

Related Items

Finite-state strategies in delay games, Approximating the minimal lookahead needed to win infinite games, Synthesizing Computable Functions from Rational Specifications Over Infinite Words, Unnamed Item, Unnamed Item, How Much Lookahead is Needed to Win Infinite Games?

Cites Work

• Synthesis of deterministic top-down tree transducers from automatic tree relations
• From liveness to promptness
• Degrees of Lookahead in Context-free Infinite Games
• On Bounded Specifications
• 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
• Facets of Synthesis: Revisiting Church’s Problem
• Alternation
• What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead
• Solving Parity Games in Big Steps
• Solving Sequential Conditions by Finite-State Strategies
• How Much Lookahead is Needed to Win Infinite Games?
• Unnamed Item
• Unnamed Item
• Unnamed Item