@InProceedings{schewe:LIPIcs.FSTTCS.2010.400,
author = {Schewe, Sven},
title = {{Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {400--411},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.400},
URN = {urn:nbn:de:0030-drops-28816},
doi = {10.4230/LIPIcs.FSTTCS.2010.400},
annote = {Keywords: Automata Theory, Complexity, B\"{u}chi Automata, Parity Automata}
}