On minimising automata with errors

DOI10.1007/978-3-642-22993-0_31MaRDI QIDQ3088051zbMATH OpenOpenAlexFDO

Authors Paweł Gawrychowski, Artur Jeż, Andreas Maletti

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)

Recommendations

• OPTIMAL HYPER-MINIMIZATION
• Hyper-minimisation Made Efficient
• Better hyper-minimization. Not as fast, but fewer errors
• Hyper-minimizing minimized deterministic finite state automata
• From equivalence to almost-equivalence, and beyond-minimizing automata with errors (extended abstract)

Cited in

(10)

• Hyper-optimization for deterministic tree automata
• Better hyper-minimization. Not as fast, but fewer errors
• From equivalence to almost-equivalence, and beyond-minimizing automata with errors (extended abstract)
• Hyper-minimisation Made Efficient
• Automaton mappings of words which multiply errors by a factor no greater than K in the Hamming and Levenshtein metrics
• Computing all -cover automata fast
• More on Minimizing Finite Automata with Errors — Nondeterministic Machines
• FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS
• An approximation algorithm for state minimization in 2-MDFAs
• Boundary sets of regular and context-free languages

This page was built for publication: On minimising automata with errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088051)