Property Testing of Regular Tree Languages

We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and generalize it to the class of ranked regular trees. We also show that the distance problem is NPcomplete on ordered trees.

• Type: Conference
• Year: 2004
• Where: ICALP
• Authors: Frédéric Magniez, Michel de Rougemont
• Keywords: Edit Distance, ICALP 2004, Regular Trees, Simple Tester, Theoretical Computer Science