Skip to main content
SpringerLink
Log in

Equivalence of Symbolic Tree Transducers

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10396))

Included in the following conference series:

  • 516 Accesses

Abstract

Symbolic tree transducers are programs that transform data trees with an infinite signature. In this paper, we show that the equivalence problem of deterministic symbolic top-down tree transducers (DTop) can be reduced to that of classical DTop. As a consequence the equivalence of two symbolic DTop can be decided in NExpTime, when assuming that all operations related to the processing of data values are in PTime. This result can be extended to symbolic DTop with lookahead and thus to deterministic symbolic bottom-up tree transducers.

This work has been partially supported by CPER Nord-Pas de Calais/FEDER DATA Advanced data science and technologies 2015–2020 and the ANR project Colis, contract number ANR-15-CE25-0001-01.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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

References

  1. Baker, B.S.: Composition of top-down and bottom-up tree transductions. Inf. Control 41(2), 186–213 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  2. Boiret, A.: Normalization and learning of transducers on trees and words. Ph.D. thesis, Lille University, France (2016)

    Google Scholar 

  3. Bojańczyk, M.: Transducers with origin information. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 26–37. Springer, Heidelberg (2014). doi:10.1007/978-3-662-43951-7_3

    Google Scholar 

  4. Choffrut, C.: Minimizing subsequential transducers: a survey. Theor. Comput. Sci. 292(1), 131–143 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007). http://www.grappa.univ-lille3.fr/tata. Accessed 12th October 2007

  6. Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Dev. 9(1), 47–68 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  7. Engelfriet, J.: Bottom-up and top-down tree transformations - a comparison. Math. Syst. Theor. 9(3), 198–231 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  8. Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Syst. Theor. 10, 289–303 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  9. Engelfriet, J.: Some Open Questions and Recent Results on Tree Transducers and Tree Languages, pp. 241–286. Academic Press, Cambridge (1980)

    Google Scholar 

  10. Engelfriet, J., Maneth, S.: Macro tree translations of linear size increase are MSO definable. SIAM J. Comput. 32(4), 950–1006 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Engelfriet, J., Maneth, S., Seidl, H.: Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. 75(5), 271–286 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Engelfriet, J., Vogler, H.: Macro tree transducers. J. Comput. Syst. Sci. 31(1), 71–146 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ésik, Z.: On functional tree transducers. In: FCT, pp. 121–127 (1979)

    Google Scholar 

  14. Ésik, Z.: Decidability results concerning tree transducers II. Acta Cybern. 6(3), 303–314 (1983)

    MathSciNet  MATH  Google Scholar 

  15. Fülöp, Z., Vogler, H.: Forward and backward application of symbolic tree transducers. Acta Inf. 51(5), 297–325 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lemay, A., Maneth, S., Niehren, J.: A learning algorithm for top-down XML transformations. In: PODS, pp. 285–296. ACM (2010)

    Google Scholar 

  17. Maneth, S.: Equivalence problems for tree transducers: a brief survey. In: Ésik, Z., Fülöp, Z. (eds.) AFL. EPTCS, vol. 151, pp. 74–93 (2014)

    Google Scholar 

  18. Seidl, H., Maneth, S., Kemper, G.: Equivalence of deterministic top-down tree-to-string transducers is decidable. In: FOCS, pp. 943–962 (2015)

    Google Scholar 

  19. Veanes, M., Bjørner, N.: Foundations of finite symbolic tree transducers. EATCS 105, 141–173 (2011)

    MathSciNet  MATH  Google Scholar 

  20. Veanes, M., Bjørner, N.: Symbolic tree transducers. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds.) PSI 2011. LNCS, vol. 7162, pp. 377–393. Springer, Heidelberg (2012). doi:10.1007/978-3-642-29709-0_32

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inria, Lille, France

    Joachim Niehren

  2. University of Lille, Lille, France

    Vincent Hugot & Adrien Boiret

  3. Links Project (Inria & Cristal Lab - UMR CNRS 9189), Lille, France

    Vincent Hugot, Adrien Boiret & Joachim Niehren

Authors
  1. Vincent Hugot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adrien Boiret
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joachim Niehren
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vincent Hugot .

Editor information

Editors and Affiliations

  1. Université de Liège, Liège, Belgium

    Émilie Charlier

  2. Université de Liège, Liège, Belgium

    Julien Leroy

  3. Université de Liège, Liège, Belgium

    Michel Rigo

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Hugot, V., Boiret, A., Niehren, J. (2017). Equivalence of Symbolic Tree Transducers. In: Charlier, É., Leroy, J., Rigo, M. (eds) Developments in Language Theory. DLT 2017. Lecture Notes in Computer Science(), vol 10396. Springer, Cham. https://doi.org/10.1007/978-3-319-62809-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-62809-7_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-62808-0

  • Online ISBN: 978-3-319-62809-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation