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

Sven Schewe. Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete. In Kamal Lodaya, Meena Mahajan, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India. Volume 8 of LIPIcs, pages 400-411, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010. [doi]

Abstract

Abstract is missing.