Property Testing of Regular Tree Languages

Authors:
Frédéric Magniez;Michel de Rougemont
Affiliations:
Univ. Paris-Sud, CNRS, LRI, Orsay, France;Univ. Paris 2, LRI, Paris, France
Venue:
Algorithmica
Year:
2007

Citing 0
Cited 4

Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A metric for rooted trees with unlabeled vertices based on nested parentheses

Theoretical Computer Science
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes

Fundamenta Informaticae
Approximate Satisfiability and Equivalence

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the edit distance with moves on the class of wordsand the class of ordered trees. We first exhibit a simple testerfor the class of regular languages on words and generalize it tothe class of ranked and unranked regular trees. We also show thatthis distance problem is NP-complete on orderedtrees.