Skip to main content
Springer Nature Link
Log in

Alphabetic Pushdown Tree Transducers

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

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

Included in the following conference series:

  • 422 Accesses

Abstract

We introduce the concept of an alphabetic pushdown tree transducer, by adding a stack to an alphabetic tree transducer in the same way as a pushdown tree automaton is obtained from a top-down tree automaton. The stack of the general model contains trees, however, we also consider a restricted model of which the stack contains only unary trees. We give a characterization of the tree transformation induced by a restricted alphabetic pushdown tree transducer in terms of an algebraic forest over a suitable ranked alphabet and a bimorphism. We compare the class of tree relations induced by the alphabetic pushdown tree transducers with known classes of tree transformations. Finally, a new hierarchy of tree relations is established.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. A.V. Aho and J.D. Ullman, The Theory of Parsing, Translation and Compiling, Vol1, Prentice-Hall, Englewood Cliffs, NJ, 1972.

    Google Scholar 

  2. S. Bozapalidis, Alphabetic tree relations, Theoret. Comput. Sci. 99 (1992) 177–211.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Bozapalidis and G. Rahonis, On two families of forests, Acta Inform. 31 (1994) 235–260.

    Article  MATH  MathSciNet  Google Scholar 

  4. C. Choffrut and K. Culik II, Properties of finite and pushdown transducers, Siam J. Comput. 12,2, (1983) 300–315.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Engelfriet, Bottom-up and top-down tree transformations. A comparison, Math. Systems Theory 9 (1975) 198–231.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. J. Engelfriet and H. Vogler, Macro Tree Transducers, J. Comput. System Sci. 31 (1985) 71–146.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Fliess, Transductions algébriques, R.A.I.R.O. R1 (1970) 109–125.

    MathSciNet  Google Scholar 

  9. Z. Fülöp and S. Vágvölgyi, Iterated deterministic top-down look-ahead, Lecture Notes in Computer Science 380 (1989) 175–184.

    Google Scholar 

  10. Z. Fülöp and S. Vágvölgyi, Top-down tree transducers with regular look-ahead, Inform. Process. Lett. 33 (1989/1990) 3–5.

    Article  MATH  MathSciNet  Google Scholar 

  11. Z. Fülöp and S. Vágvölgyi, Variants of top-down tree transducers with look-ahead, Math. Systems Theory 21 (1989) 125–145.

    Article  MathSciNet  Google Scholar 

  12. Z. Fülöp and H. Vogler, Syntax-Directed Semantics, Springer-Verlag, 1998.

    Google Scholar 

  13. F. Gécseg and M. Steinby, Tree Automata, Akadémiai Kiadó, Budapest 1984.

    MATH  Google Scholar 

  14. F. Gécseg and M. Steinby, Tree Languages, in: Handbook of Formal Languages, Vol III, G. Rozenberg and A. Salomaa, eds., Springer-Verlag, 1997, pp.1–68.

    Google Scholar 

  15. I. Guessarian, Pushdown tree automata, Math. Systems Theory 16 (1983) 237–263.

    Article  MATH  MathSciNet  Google Scholar 

  16. G. Rahonis and K. Salomaa, On the size of stack and synchronization alphabets of tree automata, Fund. Inform. 36 (1998) 57–69.

    MATH  MathSciNet  Google Scholar 

  17. G. Rahonis, Alphabetic and synchronized tree transducers, Theoret. Comput. Sci. 255 (2001) 377–399.

    Article  MATH  MathSciNet  Google Scholar 

  18. G. Rahonis, Alphabetic pushdown tree transducers, Dept. of Mathematics, University of Thessaloniki, Greece, preprint.

    Google Scholar 

  19. K. Salomaa, Synchronized tree automata, Theoret. Comput. Sci. 127 (1994) 25–51.

    Article  MATH  MathSciNet  Google Scholar 

  20. K. Yamasaki, Fundamental Properties of Pushdown Tree Transducers (PDTT) — A Top-Down Case, IEICE Trans. Inf. & Syst. E76-D,10 (1993) 1234–1242.

    Google Scholar 

  21. K. Yamasaki, Note on Domain/Surface Tree Languages of t-PDTT’s, IEICE Trans. Inf. & Syst. E79-D,6 (1996) 829–839.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    George Rahonis

Authors
  1. George Rahonis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Ésik  & Zoltán Fülöp  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rahonis, G. (2003). Alphabetic Pushdown Tree Transducers. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-45007-6_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40434-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics