@inproceedings{FridmanLodingZimmermann:Lookahead:CSL:2011,
    Abstract = {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.},
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: infinite games, delay, context-free languages},
    Author = {Fridman, Wladimir and L{\"o}ding, Christof and Zimmermann, Martin},
    BookTitle = {Proc. of CSL'11},
    Editor = {Bezem, Marc},
    File = {Degrees of Lookahead in Context-free Infinite Games - Fridman, Löding, Zimmermann (0) (0) - a - a - l.pdf},
    ISBN = {978-3-939897-32-3},
    ISSN = {1868-8969},
    Pages = {264--276},
    Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
    Series = {LIPIcs},
    Title = {Degrees of {L}ookahead in {C}ontext-free {I}nfinite {G}ames},
    URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3236},
    Volume = {12},
    Year = {2011},
    bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2011/3236},
    bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.CSL.2011.264},
    date-added = {2013-12-16 12:58:20 +0000},
    date-modified = {2015-10-01 15:08:25 +0000},
    urn = {urn:nbn:de:0030-drops-32365},
    doi = {10.4230/LIPIcs.CSL.2011.264}
}

@inproceedings{FridmanLodingZimmermann:Lookahead:CSL:2011, Abstract = {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.}, Address = {Dagstuhl, Germany}, Annote = {Keywords: infinite games, delay, context-free languages}, Author = {Fridman, Wladimir and L{\"o}ding, Christof and Zimmermann, Martin}, BookTitle = {Proc. of CSL'11}, Editor = {Bezem, Marc}, File = {Degrees of Lookahead in Context-free Infinite Games - Fridman, Löding, Zimmermann (0) (0) - a - a - l.pdf}, ISBN = {978-3-939897-32-3}, ISSN = {1868-8969}, Pages = {264--276}, Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, Series = {LIPIcs}, Title = {Degrees of {L}ookahead in {C}ontext-free {I}nfinite {G}ames}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3236}, Volume = {12}, Year = {2011}, bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2011/3236}, bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.CSL.2011.264}, date-added = {2013-12-16 12:58:20 +0000}, date-modified = {2015-10-01 15:08:25 +0000}, urn = {urn:nbn:de:0030-drops-32365}, doi = {10.4230/LIPIcs.CSL.2011.264} }