Top-down tree edit-distance of regular tree languages

DOI10.1007/978-3-319-04921-2_38MaRDI QIDQ5404936zbMATH OpenOpenAlexFDO

Authors Sang-Ki Ko, Yo-Sub Han, Kai Salomaa

Publication date 31 March 2014

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04921-2_38

zbMATH Keywords

dynamic programmingregular tree languagestree automatatree edit-distance

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The edit-distance between a regular language and a context-free language
• Alignment distance of regular tree languages
• Alignment distance of regular tree languages
• Computing the edit distance of a regular language
• Computing the edit-distance between a regular language and a context-free language

Cited in

(6)

• Finite Approximations and Similarity of Languages
• The edit-distance between a regular language and a context-free language
• Automata, Languages and Programming
• Bounded repairability for regular tree languages
• Alignment distance of regular tree languages
• Alignment distance of regular tree languages

This page was built for publication: Top-down tree edit-distance of regular tree languages

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