arXiv Open Access 2020

Approximating the Minimal Lookahead Needed to Win Infinite Games

Martin Zimmermann

Lihat Sumber

Abstrak

We present an exponential-time algorithm approximating the minimal lookahead necessary to win an $ω$-regular delay game.

cs.FL cs.GT

Martin Zimmermann

APA MLA BibTeX

Zimmermann, M. (2020). Approximating the Minimal Lookahead Needed to Win Infinite Games. https://arxiv.org/abs/2010.11706

Lihat di Sumber

Informasi Jurnal