Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete

Sven Schewe
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular languages, and deterministic \buchi, \cobuchi, and parity automata play a similar role in the recognition of $\omega$-regular languages. While it is well known that the minimisation of deterministic finite and weak automata is cheap, the complexity of minimising deterministic \buchi\ and parity automata has remained an open challenge. We...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.