History-Deterministic Büchi Automata are Succinct
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914608256647168 |
|---|---|
| author | Casares, Antonio Prakash, Keya Thejaswini, K. S. |
| author_facet | Casares, Antonio Prakash, Keya Thejaswini, K. S. |
| contents | We describe a history-deterministic Büchi automaton that has strictly less states than every language-equivalent deterministic Büchi automaton. This solves a problem that had been open since the introduction of history-determinism and actively investigated for over a decade.
Our example automaton has 65 states, and proving its succinctness requires the combination of theoretical insights together with the aid of computers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_05380 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | History-Deterministic Büchi Automata are Succinct Casares, Antonio Prakash, Keya Thejaswini, K. S. Formal Languages and Automata Theory We describe a history-deterministic Büchi automaton that has strictly less states than every language-equivalent deterministic Büchi automaton. This solves a problem that had been open since the introduction of history-determinism and actively investigated for over a decade. Our example automaton has 65 states, and proving its succinctness requires the combination of theoretical insights together with the aid of computers. |
| title | History-Deterministic Büchi Automata are Succinct |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2603.05380 |