"Minimizing Finite Automata Is Computationally Hard."

Andreas Malcher (2003)
a service of Schloss Dagstuhl - Leibniz Center for Informatics