Characterizing the Polynomial-Time Minimizable $\omega$-Automata
Formal Languages and Automata Theory
2025-04-30 v1 Logic in Computer Science
Abstract
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\"uchi automata with transition-based acceptance are NP-hard to minimize, as are history-deterministic B\"uchi automata with transition-based acceptance.
Keywords
Cite
@article{arxiv.2504.20553,
title = {Characterizing the Polynomial-Time Minimizable $\omega$-Automata},
author = {Bader Abu Radi and Rüdiger Ehlers},
journal= {arXiv preprint arXiv:2504.20553},
year = {2025}
}