Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

4

ICALP
2004
Springer

favoriteEmaildiscussreport

138views Programming Languages» more ICALP 2004»

Property Testing of Regular Tree Languages

13 years 9 months ago

Property Testing of Regular Tree Languages

Download www.lri.fr

We consider the Edit distance with moves on the class of words and the class of ordered trees. We ﬁrst 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

Real-time Traffic

Edit Distance | ICALP 2004 | Regular Trees | Simple Tester | Theoretical Computer Science |

claim paper

Related Content

» Properties of QuasiRelabeling Tree Bimorphisms

» Algorithmic Properties of Millstream Systems

» Improving the Representation of Infinite Trees to Deal with Sets of Trees

» Some Results on TopContextFree Tree Languages

» Languages Modulo Normalization

» Intercode Regular Languages

» Efficient Software Model Checking of Data Structure Properties

» Rigid Tree Automata

» On the Power of TreeWalking Automata

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	ICALP
Authors	Frédéric Magniez, Michel de Rougemont

Comments (0)