On Minimising Automata with Errors

DOI10.1007/978-3-642-22993-0_31zbMath1343.68137OpenAlexW1778210529MaRDI QIDQ3088051

Artur Jeż, Andreas Maletti, Paweł Gawrychowski

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_31

zbMATH Keywords

finite automatonlossy compressionminimisation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Boundary sets of regular and context-free languages ⋮ Computing All ℓ-Cover Automata Fast ⋮ Hyper-optimization for deterministic tree automata