Approximating the Minimal Lookahead Needed to Win Infinite Games

10/22/2020

∙

by   Martin Zimmermann, et al.

∙

0

∙

share

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