Degrees of Lookahead in Context-free Infinite Games

Authors Wladimir Fridman, Christof Löding, Martin Zimmermann

Thumbnail PDF


  • Filesize: 0.51 MB
  • 13 pages

Document Identifiers

Author Details

Wladimir Fridman
Christof Löding
Martin Zimmermann

Cite AsGet BibTex

Wladimir Fridman, Christof Löding, and Martin Zimmermann. Degrees of Lookahead in Context-free Infinite Games. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 264-276, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


We continue the investigation of delay games, infinite games in which one player may postpone her moves for some time to obtain a lookahead on her opponent's moves. We show that the problem of determining the winner of such a game is undecidable for deterministic context-free winning conditions. Furthermore, we show that the necessary lookahead to win a deterministic context-free delay game cannot be bounded by any elementary function. Both results hold already for restricted classes of deterministic context-free winning conditions.
  • infinite games
  • delay
  • context-free languages


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail