论文信息 - Property Testing of Regular Tree Languages

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. In the complete version of the paper, we show that the distance problem is NP-complete on ordered trees.

Frédéric Magniez | Michel de Rougemont

[1] Orna Kupferman,et al. omega-Regular Languages Are Testable with a Constant Number of Queries , 2002, RANDOM.

[2] Dan Suciu,et al. Typechecking for XML transformers , 2000, J. Comput. Syst. Sci..

[3] Derick Wood,et al. One-Unambiguous Regular Languages , 1998, Inf. Comput..

[4] Ronitt Rubinfeld. On the Robustness of Functional Equations , 1999, SIAM J. Comput..

[5] Noga Alon,et al. Regular Languages are Testable with a Constant Number of Queries , 2000, SIAM J. Comput..

[6] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[7] Graham Cormode,et al. Sequence distance embeddings , 2003 .

[8] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[9] Noga Alon,et al. Efficient Testing of Large Graphs , 2000, Comb..

[10] Kuo-Chung Tai,et al. The Tree-to-Tree Correction Problem , 1979, JACM.

[11] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.

[12] James W. Thatcher,et al. Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory , 1967, J. Comput. Syst. Sci..

[13] Dana Shapira,et al. Edit distance with move operations , 2002, J. Discrete Algorithms.

[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .