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

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

Sebastian Jakobi, Markus Holzer

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

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Boundary sets of regular and context-free languages ⋮ Unnamed Item ⋮ Hyper-optimization for deterministic tree automata

This page was built for publication: From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with Errors