Skip to main content
Log in

Tree Series Transformations that Respect Copying

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We consider tree series transducers which were introduced in [EFV], and define the tree-to-tree series transformations computed by them in two different ways. One of the definitions is based on the ←-substitution of tree series taken from [EFV] while the other one is based on a new tree series substitution introduced in this paper. This new substitution is called -substitution and the main difference between the ←- and the -substitutions is that the first one does not take into account the number of the occurrences of the substitution variables while the second one does. We compare the two different ways of computing tree-to-tree series transformations and show that, for the -substitution, fundamental relations from the theory of tree transducers carry over to tree series transducers.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fülöp, Vogler Tree Series Transformations that Respect Copying . Theory Comput. Systems 36, 247–293 (2003). https://doi.org/10.1007/s00224-003-1072-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-003-1072-z

Keywords

Navigation