Skip to main content
SpringerLink
Log in

The Power of Tree Series Transducers of Type I and II

  • Conference paper
Developments in Language Theory (DLT 2005)

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

Included in the following conference series:

Abstract

The power of tree series transducers of type I and II is studied for IO as well as OI tree series substitution. More precisely, it is shown that the IO tree series transformations of type I (respectively, type II) are characterized by the composition of homomorphism top-down IO tree series transformations with bottom-up (respectively, linear bottom-up) IO tree series transformations. On the other hand, polynomial OI tree series transducers of type I and II and top-down OI tree series transducers are equally powerful.

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. Kuich, W.: Tree transducers and formal tree series. Acta Cybernet 14, 135–149 (1999)

    MATH  MathSciNet  Google Scholar 

  2. Engelfriet, J., Fülöp, Z., Vogler, H.: Bottom-up and top-down tree series transformations. J. Autom. Lang. Comb. 7, 11–70 (2002)

    MATH  MathSciNet  Google Scholar 

  3. Fülöp, Z., Vogler, H.: Tree series transformations that respect copying. Theory Comput. Syst. 36, 247–293 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoret. Comput. Sci. 18, 115–148 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kuich, W.: Formal power series over trees. In: Bozapalidis, S. (ed.) Proc. 3rd Int. Conf. Developments in Language Theory, pp. 61–101. Aristotle University of Thessaloniki (1997)

    Google Scholar 

  6. Borchardt, B., Vogler, H.: Determinization of finite state weighted tree automata. J. Autom. Lang. Comb. 8, 417–463 (2003)

    MATH  MathSciNet  Google Scholar 

  7. Kuich, W.: Full abstract families of tree series I. In: Karhumäki, J., Maurer, H.A., Paun, G., Rozenberg, G. (eds.) Jewels Are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp. 145–156. Springer, Heidelberg (1999)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Ésik, Z., Kuich, W.: Formal tree series. J. Autom. Lang. Comb. 8, 219–285 (2003)

    MATH  MathSciNet  Google Scholar 

  10. Bozapalidis, S.: Context-free series on trees. Inform. and Comput. 169, 186–229 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Bozapalidis, S.: Equational elements in additive algebras. Theory Comput. Syst. 32, 1–33 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät Informatik, Technische Universität Dresden, D-01062, Dresden, Germany

    Andreas Maletti

Authors
  1. Andreas Maletti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Applicazioni, Università di Salerno, via Ponte Don Melillo, 84084, Fisciano, SA, Italy

    Clelia De Felice

  2. Dipartimento di Matematica ed Applicazioni, Università di Palermo, Via Archirafi, 34, 90123, Palermo, Italy

    Antonio Restivo

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maletti, A. (2005). The Power of Tree Series Transducers of Type I and II. In: De Felice, C., Restivo, A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11505877_30

Download citation

  • DOI: https://doi.org/10.1007/11505877_30

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31682-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation