Alignment distance of regular tree languages

DOI10.1007/978-3-319-60134-2_11zbMath1429.68115OpenAlexW2619986165MaRDI QIDQ5920054

Sang-Ki Ko, Yo-Sub Han

Publication date: 22 August 2017

Published in: Implementation and Application of Automata (Search for Journal in Brave)

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

zbMATH Keywords

regular tree languagestree automatatree alignmentalignment edit-distance

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Finite Approximations and Similarity of Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alignment of trees -- an alternative to tree edit
• On the editing distance between unordered labeled trees
• Some MAX SNP-hard results concerning unordered labeled trees
• A constrained edit distance between unordered labeled trees
• Error-correcting tree language inference
• Proof verification and the hardness of approximation problems
• The Tree-to-Tree Correction Problem
• Theoretical Computer Science
• Approximate matching of XML document with regular hedge grammar

This page was built for publication: Alignment distance of regular tree languages