Skip to main content
SpringerLink
Log in

Top-down tree transducers with regular look-ahead

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

An Erratum to this article was published on 29 August 2015

Abstract

Top-down tree transducers with regular look-ahead are introduced. It is shown how these can be decomposed and composed, and how this leads to closure properties of surface sets and tree transformation languages. Particular attention is paid to deterministic tree transducers.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Arnold andM. Dauchet, Transductions de forets regulieres monadiques; forets coregulieres,RAIRO 10 (1976), 5–28.

    Google Scholar 

  2. P. R. J. Asveld, Controlled iteration grammars and full hyper-AFL's,Memoradum 114, Technical University Twente, Holland, 1976.

    Google Scholar 

  3. B. S. Baker, Tree transductions and families of tree languages, Ph.D. Thesis, Harvard University,Report TR-9-73, 1973 (also:5th Theory of Computing, 200–206).

  4. K. Čulik II andR. Cohen, LR-regular grammars—an extension of LR(k) grammars,JCSS 7 (1973), 66–96.

    Google Scholar 

  5. P. J. Downey, Tree transducers andETOL tree systems (abstract),Conference on Formal Languages, Automata and Development, Noordwijkerhout, Holland, 1975.

    Google Scholar 

  6. A. Ehrenfeucht andG. Rozenberg, On inverse homomorphic images of deterministicETOL languages,LOCOS 13, Utrecht University, Holland, 1974.

    Google Scholar 

  7. J. Engelfriet, Bottom-up and top-down tree transformations—a comparison,Math. Syst. Theory 9 (1975), 198–231. This paper is also referred to as BT.

    Google Scholar 

  8. J. Engelfriet, Surface tree languages and parallel derivation trees,DAIMI Report PB-44, Aarhus University, Denmark, 1975 (to appear in Theoretical Computer Science).

  9. G. T. Herman andG. Rozenberg,Developmental systems and languages, North-Holland Publ. Co., Amsterdam, 1975.

    Google Scholar 

  10. J. E. Hopcroft andJ. D. Ullman,Formal languages and their relation to automata, Addison-Wesley Publ. Co., Reading, Mass., 1969.

    Google Scholar 

  11. L. S. Levy andA. K. Joshi, Some results in tree automata,Math. Syst. Theory 6 (1973), 334–342.

    Google Scholar 

  12. W. F. Ogden andW. C. Rounds, Composition ofn transducers,4th Symp. on Theory of Computing, 1972, pp. 198–206.

  13. W. C. Rounds, Mappings and grammars on trees,Math. Syst. Theory,4 (1970), 257–287.

    Google Scholar 

  14. J. W. Thatcher, Generalized2 sequential machine maps,JCSS 4 (1970), 339–367.

    Google Scholar 

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

  16. M. Dauchet,Transductions inversibles de forets, These, Univ. de Lille, France, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Twente University of Technology, Enschede, Netherlands

    Joost Engelfriet

Authors
  1. Joost Engelfriet
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The research reported here was carried out during a one-year visit of the author to the Dept. of Computer Science of Aarhus University, Aarhus, Denmark.

An erratum to this article is available at http://dx.doi.org/10.1007/s00224-015-9647-z.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Engelfriet, J. Top-down tree transducers with regular look-ahead. Math. Systems Theory 10, 289–303 (1976). https://doi.org/10.1007/BF01683280

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01683280

Keywords

Search

Navigation