Weighted automata computation of edit distances with consolidations and fragmentations

DOI10.1016/j.ic.2020.104652zbMath1483.68171OpenAlexW2886718837MaRDI QIDQ2064523

Mathieu Giraud, Florent Jacquemard

Publication date: 6 January 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01857267v4/file/ms-automata.pdf

zbMATH Keywords

fragmentationconsolidationweighted automataedit distancebounded semiringedit operation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deleting string rewriting systems preserve regularity
• Handbook of weighted automata
• The Removal of Weighted ε-Transitions
• Algorithms for approximate string matching
• Regular Algebra Applied to Path-finding Problems
• The String-to-String Correction Problem
• Semirings and Formal Power Series
• Fun with semirings
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS

This page was built for publication: Weighted automata computation of edit distances with consolidations and fragmentations