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]

@inproceedings{Schewe10-1,
  title = {Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete},
  author = {Sven Schewe},
  year = {2010},
  doi = {10.4230/LIPIcs.FSTTCS.2010.400},
  url = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.400},
  tags = {completeness},
  researchr = {https://researchr.org/publication/Schewe10-1},
  cites = {0},
  citedby = {0},
  pages = {400-411},
  booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India},
  editor = {Kamal Lodaya and Meena Mahajan},
  volume = {8},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-939897-23-1},
}