From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with Errors

DOI10.1007/978-3-642-31653-1_18zbMath1370.68175MaRDI QIDQ3167495

Markus Holzer, Sebastian Jakobi

Publication date: 2 November 2012

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31653-1_18

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)