Skip to main content
SpringerLink
Log in

Property Testing of Regular Tree Languages

  • Conference paper
Automata, Languages and Programming (ICALP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3142))

Included in the following conference series:

Abstract

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.

Complete version at http://www.lri.fr/~magniez. Work supported by ACI Sécurité Informatique: VERA of the French Ministry of Research.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 239.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. Combinatorica 20, 451–476 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alon, N., Krivelich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. SIAM Journal on Computing 30(6) (2000)

    Google Scholar 

  3. Blum, M., Kannan, S.: Designing programs that check their work. Journal of the ACM 42(1), 269–291 (1995)

    Article  MATH  Google Scholar 

  4. Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences 47(3), 549–595 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chockler, H., Kupferman, O.: ω-regular languages are testable with a constant number of queries. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 26–38. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Cormode, G.: Sequence Distance Embeddings. PhD thesis, University of Warwick (2003)

    Google Scholar 

  7. Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM 45(4), 653–750 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  8. Rubinfeld, R.: On the robustness of functional equations. SIAM Journal on Computing 28(6), 1972–1997 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing 25(2), 23–32 (1996)

    Article  MathSciNet  Google Scholar 

  10. Tai, K.: The tree-to-tree correction problem. Journal of the ACM 26, 422–433 (1979)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS–LRI, UMR 8623 Université Paris–Sud, France

    Frédéric Magniez

  2. LRI & Université Paris II, France

    Michel de Rougemont

Authors
  1. Frédéric Magniez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel de Rougemont
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Campus Nord - Ed. Omega, 240 Jordi Girona Salgado, 1-3 E-08034, Barcelona

    Josep Díaz

  2. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  3. Department of Mathematics, University of Turku, Turku, Finland

    Arto Lepistö

  4. Laboratory for Foundations of Computer Science, University of Edinburgh,  

    Donald Sannella

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Magniez, F., de Rougemont, M. (2004). Property Testing of Regular Tree Languages. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_78

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27836-8_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22849-3

  • Online ISBN: 978-3-540-27836-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation