Sciweavers

Share
ICALP
2004
Springer

Property Testing of Regular Tree Languages

10 years 8 months ago
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.
Frédéric Magniez, Michel de Rougemon
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where ICALP
Authors Frédéric Magniez, Michel de Rougemont
Comments (0)
books