Degrees of Lookahead in Regular Infinite Games
From MaRDI portal
Publication:3166215
DOI10.2168/LMCS-8(3:24)2012zbMath1248.68299MaRDI QIDQ3166215
Michael Holtmann, Wolfgang Thomas, Łukasz Kaiser
Publication date: 22 October 2012
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
2-person games (91A05) Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (13)
Active learning of sequential transducers with side information about the domain ⋮ Delay Games with WMSO$$+$$U Winning Conditions ⋮ Finite-state strategies in delay games ⋮ Approximating the minimal lookahead needed to win infinite games ⋮ On computability of data word functions defined by transducers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control ⋮ Unnamed Item ⋮ Multi-buffer simulations: decidability and complexity ⋮ Unnamed Item ⋮ How Much Lookahead is Needed to Win Infinite Games? ⋮ Topological Characterisation of Multi-Buffer Simulation
This page was built for publication: Degrees of Lookahead in Regular Infinite Games
