Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
Abstract
Our main technical contribution is a polynomial-time determinisation procedure for history-deterministic Büchi 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üchi automata, which paves the way to our polynomial-time determinisation procedure.
- Publication:
-
arXiv e-prints
- Pub Date:
- April 2024
- DOI:
- 10.48550/arXiv.2404.17530
- arXiv:
- arXiv:2404.17530
- Bibcode:
- 2024arXiv240417530A
- Keywords:
-
- Computer Science - Formal Languages and Automata Theory
- E-Print:
- Full version of paper accepted at ICALP 2024