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

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 establish the NP-completeness of these problems. A second contribution of this paper is the introduction of almost equivalence, an equivalence class for strictly between language equivalence for deterministic \buchi\ or \cobuchi\ automata and language equivalence for deterministic finite automata. Two finite automata are almost equivalent if they, when used as a monitor, provide a different answer only a bounded number of times in any run, and we call the minimal such automaton relatively minimal. Minimisation of DFAs, hyper-minimisation, relative minimisation, and the minimisation of deterministic \buchi\ (or \cobuchi) automata are operations of increasing reduction power, as the respective equivalence relations on automata become coarser from left to right. Besides being a natural equivalence relation for finite automata, almost equivalence is language preserving for weak automata, and can therefore also be viewed as a generalisation of language equivalence for weak automata to a more general class of automata. From the perspective of \buchi\ and \cobuchi\ automata, we gain a cheap algorithm for state-space reduction that also turns out to be beneficial for further heuristic or exhaustive state-space reductions put on top of it.

[1]  Sven Schewe.  Minimisation of Deterministic Parity and Buchi Automata and Relative Minimisation of Deterministic Finite Automata , 2010, ArXiv.

[2]  R. J. Nelson,et al.  Introduction to Automata , 1968 .

[3]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[4]  A. Pnueli,et al.  On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.

[5]  Amir Pnueli,et al.  On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.

[6]  Bernd Finkbeiner,et al.  Uniform distributed synthesis , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[7]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[8]  Orna Kupferman,et al.  Synthesizing Distributed Systems , 2001, LICS.

[9]  Christof Löding,et al.  Efficient minimization of deterministic weak omega-automata , 2001, Inf. Process. Lett..

[10]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[11]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[12]  O. Kupermann,et al.  Synthesizing distributed systems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[13]  Artur Jez,et al.  Hyper-minimisation Made Efficient , 2009, MFCS.

[14]  Nir Piterman,et al.  From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[15]  P. S. Thiagarajan,et al.  Distributed Controller Synthesis for Local Specifications , 2001, ICALP.

[16]  Sven Schewe,et al.  Tighter Bounds for the Determinisation of Büchi Automata , 2009, FoSSaCS.

[17]  Rüdiger Ehlers,et al.  Minimising Deterministic Büchi Automata Precisely Using SAT Solving , 2010, SAT.

[18]  Igor Walukiewicz,et al.  Relating Hierarchies of Word and Tree Automata , 1998, STACS.

[19]  M. Rabin.  Automata on Infinite Objects and Church's Problem , 1972 .

[20]  Viliam Geffert,et al.  Hyper-minimizing minimized deterministic finite state automata , 2009, RAIRO Theor. Informatics Appl..

[21]  Christel Baier,et al.  Principles of model checking , 2008 .

[22]  Bernd Finkbeiner,et al.  Synthesis of Asynchronous Systems , 2006, LOPSTR.

[23]  Andrew Badr.  Hyper-Minimization in O(n2) , 2008, CIAA.

[24]  Igor Walukiewicz,et al.  Distributed Games , 2003, FSTTCS.

[25]  Olivier Carton,et al.  Computing the Rabin Index of a Parity Automaton , 1999, RAIRO Theor. Informatics Appl..

[26]  Amir Pnueli,et al.  Distributed reactive systems are hard to synthesize , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.