Degrees of Lookahead in Context-free Infinite Games

DOI10.4230/LIPIcs.CSL.2011.264zbMath1247.68137OpenAlexW1941150702MaRDI QIDQ2915687

Christof Löding, Martín G. Zimmermann, Wladimir Fridman

Publication date: 18 September 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_43fe.html

zbMATH Keywords

delayinfinite gamescontext-free languages

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45)

Related Items (8)

Delay Games with WMSO$$+$$U Winning Conditions ⋮ Finite-state strategies in delay games ⋮ Delay Games with WMSO+U Winning Conditions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ How Much Lookahead is Needed to Win Infinite Games? ⋮ How Much Lookahead is Needed to Win Infinite Games?

This page was built for publication: Degrees of Lookahead in Context-free Infinite Games