Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914607582412800 |
|---|---|
| author | Acharya, Rohan Jurdziński, Marcin Prakash, Keya |
| author_facet | Acharya, Rohan Jurdziński, Marcin Prakash, Keya |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_17530 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata Acharya, Rohan Jurdziński, Marcin Prakash, Keya Formal Languages and Automata Theory 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. |
| title | Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2404.17530 |