Characterizing the Polynomial-Time Minimizable $ω$-Automata
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909596818341888 |
|---|---|
| author | Radi, Bader Abu Ehlers, Rüdiger |
| author_facet | Radi, Bader Abu Ehlers, Rüdiger |
| contents | A central question in the theory of automata is which classes of automata can be minimized in polynomial time. We close the remaining gaps for deterministic and history-deterministic automata over infinite words by proving that deterministic co-Büchi automata with transition-based acceptance are NP-hard to minimize, as are history-deterministic Büchi automata with transition-based acceptance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_20553 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Characterizing the Polynomial-Time Minimizable $ω$-Automata Radi, Bader Abu Ehlers, Rüdiger Formal Languages and Automata Theory Logic in Computer Science A central question in the theory of automata is which classes of automata can be minimized in polynomial time. We close the remaining gaps for deterministic and history-deterministic automata over infinite words by proving that deterministic co-Büchi automata with transition-based acceptance are NP-hard to minimize, as are history-deterministic Büchi automata with transition-based acceptance. |
| title | Characterizing the Polynomial-Time Minimizable $ω$-Automata |
| topic | Formal Languages and Automata Theory Logic in Computer Science |
| url | https://arxiv.org/abs/2504.20553 |