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 B

• Type: Journal
• Year: 2010
• Where: FSTTCS
• Authors: Sven Schewe
• Keywords: Deterministic, Deterministic Büchi, FSTTCS 2010, Parity Automata, Software Engineering