How to Remove the Look-Ahead of Top-Down Tree Transducers

  • Joost Engelfriet
  • Sebastian Maneth
  • Helmut Seidl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8633)

Abstract

For a top-down tree transducer with regular look-ahead we introduce the notion of difference bound, which is a number bounding the difference in output height for any two look-ahead states of the transducer. We present an algorithm that, for a given transducer with a known difference bound, decides whether it is equivalent to a transducer without regular look-ahead, and constructs such a transducer if the answer is positive. All transducers are total and deterministic.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., D’Antoni, L.: Streaming tree transducers. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 42–53. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  2. 2.
    Berstel, J.: Transductions and Context-Free Languages. Teubner-Verlag (1979)Google Scholar
  3. 3.
    Choffrut, C.: Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationnelles. Theor. Comput. Sci. 5(3), 325–337 (1977)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Drewes, F.: Grammatical Picture Generation – A Tree-Based Approach. Springer (2006)Google Scholar
  5. 5.
    Engelfriet, J.: Top-down tree transducers with regular look-ahead. Mathematical Systems Theory 10, 289–303 (1977)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    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)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Engelfriet, J., Maneth, S., Seidl, H.: Look-ahead removal for top-down tree transducers. CoRR abs/1311.2400 (2013)Google Scholar
  8. 8.
    Engelfriet, J., Vogler, H.: Macro tree transducers. J. Comput. Syst. Sci. 31(1), 71–146 (1985)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Ésik, Z.: Decidability results concerning tree transducers I. Acta Cybern. 5, 1–20 (1980)MATHGoogle Scholar
  10. 10.
    Filiot, E., Servais, F.: Visibly pushdown transducers with look-ahead. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 251–263. Springer, Heidelberg (2012)Google Scholar
  11. 11.
    Hosoya, H.: Foundations of XML Processing – The Tree-Automata Approach. Cambridge University Press (2010)Google Scholar
  12. 12.
    Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol. 3406, pp. 1–24. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Lemay, A., Maneth, S., Niehren, J.: A learning algorithm for top-down XML transformations. In: PODS, pp. 285–296 (2010)Google Scholar
  14. 14.
    Maletti, A., Graehl, J., Hopkins, M., Knight, K.: The power of extended top-down tree transducers. SIAM J. Comput. 39(2), 410–430 (2009)CrossRefMATHMathSciNetGoogle Scholar
  15. 15.
    Martens, W., Neven, F., Gyssens, M.: Typechecking top-down XML transformations: Fixed input or output schemas. Inf. Comput. 206(7), 806–827 (2008)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Joost Engelfriet
    • 1
  • Sebastian Maneth
    • 2
  • Helmut Seidl
    • 3
  1. 1.LIACSLeiden UniversityThe Netherlands
  2. 2.School of InformaticsUniversity of EdinburghUnited Kingdom
  3. 3.Institut für InformatikTechnische Universität MünchenGermany

Personalised recommendations