Skip to main content
SpringerLink
Log in

Minimization of Deterministic Bottom-Up Tree Transducers

  • Conference paper
Developments in Language Theory (DLT 2010)

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

Included in the following conference series:

Abstract

We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of normalizing transformations which, among others, guarantee that non-trivial output is produced as early as possible. For a deterministic bottom-up transducer where every state produces either none or infinitely many outputs, the minimal transducer can be constructed in polynomial time.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Ullman, J.D.: Translations on a context-free grammar. Inform. and Control 19, 439–475 (1971)

    Article  MathSciNet  Google Scholar 

  2. Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)

    MATH  Google Scholar 

  3. Courcelle, B., Franchi-Zannettacci, P.: On the equivalence problem for attribute systems. Inform. and Control 52, 275–305 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  4. Engelfriet, J.: Bottom-up and top-down tree transformations — a comparison. Math. Systems Theory 9, 198–231 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  5. Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Systems Theory 10, 289–303 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  6. Engelfriet, J.: Some open questions and recent results on tree transducers and tree languages. In: Book, R.V. (ed.) Formal language theory; perspectives and open problems. Academic Press, New York (1980)

    Google Scholar 

  7. Engelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput. 154, 34–91 (1999)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Engelfriet, J., Maneth, S.: The equivalence problem for deterministic MSO tree transducers is decidable. Inform. Proc. Letters 100, 206–212 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. 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  MATH  MathSciNet  Google Scholar 

  11. Ésik, Z.: Decidability results concerning tree transducers I. Acta Cybernetica 5, 1–20 (1980)

    MATH  MathSciNet  Google Scholar 

  12. Filiot, E., Raskin, J.-F., Reynier, P.-A., Servais, F., Talbot, J.-M.: Properties of visibly pushdown transducers (submitted 2010)

    Google Scholar 

  13. Fülöp, Z.: On attributed tree transducers. Acta Cybernetica 5, 261–279 (1981)

    MATH  Google Scholar 

  14. Fülöp, Z., Vágvölgyi, S.: Attributed tree transducers cannot induce all deterministic bottom-up tree transformations. Inform. and Comput. 116, 231–240 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  15. Fülöp, Z., Vogler, H.: Syntax-Directed Semantics – Formal Models based on Tree Transducers. In: Brauer, W., Rozenberg, G., Salomaa, A. (eds.) EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (1998)

    Google Scholar 

  16. Gazdag, Z.: Decidability of the shape preserving property of bottom-up tree transducers. Int. J. Found. Comput. Sci. 17(2), 395–414 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  17. Knuth, D.E.: Semantics of context-free languages. Math. Systems Theory 2, 127–145 (1968); Corrections in Math. Systems Theory 5, 95–96 (1971)

    Google Scholar 

  18. Laurence, G., Lemay, A., Niehren, J., Staworko, S., Tommasi, M.: Linear top-down tree-to-word transducers: Characterization and minimization. In: RTA (to appear 2010)

    Google Scholar 

  19. Lemay, A., Maneth, S., Niehren, J.: A learning algorithm for top-down XML transformations. In: PODS (to appear 2010)

    Google Scholar 

  20. Mohri, M.: Minimization algorithms for sequential transducers. Theor. Comput. Sci. 234, 177–201 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  21. Rounds, W.C.: Mappings and grammars on trees. Math. Systems Theory 4, 257–287 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  22. Seidl, H.: Single-valuedness of tree transducers is decidable in polynomial time. Theor. Comput. Sci. 106(1), 135–181 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  23. Thatcher, J.W.: Generalized2 sequential machine maps. J. Comp. Syst. Sci. 4, 339–367 (1970)

    MATH  MathSciNet  Google Scholar 

  24. Thatcher, J.W.: Tree automata: an informal survey. In: Aho, A.V. (ed.) Currents in the Theory of Computing, pp. 143–172. Prentice Hall, Englewood Cliffs (1973)

    Google Scholar 

  25. Zachar, Z.: The solvability of the equivalence problem for deterministic frontier-to-root tree transducers. Acta Cybernetica 4, 167–177 (1980)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität München, Garching, Germany

    Sylvia Friese & Helmut Seidl

  2. NICTA and University of New South Wales, Sydney, Australia

    Sebastian Maneth

Authors
  1. Sylvia Friese
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Helmut Seidl
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sebastian Maneth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Western Ontario, N6A 5B7, London, ON, Canada

    Yuan Gao , Hanlin Lu , Shinnosuke Seki  & Sheng Yu , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Friese, S., Seidl, H., Maneth, S. (2010). Minimization of Deterministic Bottom-Up Tree Transducers. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14455-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14454-7

  • Online ISBN: 978-3-642-14455-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation