Minimization of deterministic finite automata modulo the edit distance

DOI10.4230/LIPICS.MFCS.2025.77MaRDI QIDQ7310252zbMATH OpenFDO

Authors Jakub Michaliszyn, Jan Otop

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2025.77

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Bounded repairability of word languages
• Edit distance for pushdown automata
• Handbook of automata theory. Volume II. Automata in mathematics and selected applications
• scientific article; zbMATH DE number 3460178 (Why is no real title available?)
• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• scientific article; zbMATH DE number 7361973 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• scientific article; zbMATH DE number 3189697 (Why is no real title available?)
• Hyper-minimisation Made Efficient
• Hyper-minimization for deterministic tree automata
• OPTIMAL HYPER-MINIMIZATION
• Sublinear approximate string matching and biological applications
• The equivalence problem for deterministic pushdown automata is decidable

This page was built for publication: Minimization of deterministic finite automata modulo the edit distance

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