Lookahead Games and Efficient Determinisation of History-Deterministic B\"uchi Automata
<|reference_start|>Lookahead Games and Efficient Determinisation of History-Deterministic B\"uchi Automata: Our main technical contribution is a polynomial-time determinisation procedure for history-deterministic B\"uchi automata, which settles an open question of Kuperberg and Skrzypczak, 2015. A key conceptual contribution is the lookahead game, which is a variant of Bagnol and Kuperberg's token game, in which Adam is given a fixed lookahead. We prove that the lookahead game is equivalent to the 1-token game. This allows us to show that the 1-token game characterises history-determinism for semantically-deterministic B\"uchi automata, which paves the way to our polynomial-time determinisation procedure.<|reference_end|>
@article{acharya2024lookahead,
    title={Lookahead Games and Efficient Determinisation of History-Deterministic
  B\"uchi Automata},
    author={Rohan Acharya, Marcin Jurdzi'nski, Aditya Prakash},
    journal={arXiv preprint arXiv:2404.17530},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.17530},
    primaryClass={cs.FL}
}