Skip to main content
SpringerLink
Log in

Basic tree transducers

  • Tree-Automata And Transducers
  • Conference paper
  • First Online:
Book cover CAAP '86 (CAAP 1986)

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

Included in the following conference series:

  • 142 Accesses

The work of the author has been supported by the Netherlands Organization for the Advancement of Pure Research (Z.W.O.).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho; Indexed grammars, an extension of context-free grammars; JACM 15 (1968), 647–671.

    Google Scholar 

  2. A.V. Aho; Nested stack automata; JACM 16 (1969), 383–406.

    Google Scholar 

  3. B. Courcelle; A representation of trees by languages I and II; TCS 6 (1978), 255–279 and TCS 7 (1978), 25–55.

    Google Scholar 

  4. B. Courcelle, P. Franchi-Zannettacci; Attribute grammars and recursive program schemes I, II; TCS 17 (1982), 163–191 and TCS 17 (1982), 235–257.

    Google Scholar 

  5. W. Damm; The IO-and OI-hierarchies; TCS 20 (1982), 95–206.

    Google Scholar 

  6. W. Damm, A. Goerdt; An automata-theoretic characterization of the OI-hierarchy; Proc. 9th ICALP, 1982, Aarhus, pp. 141–153.

    Google Scholar 

  7. W. Damm, I. Guessarian; Combining T and level n; Proc. of the 9th Mathematical Foundations of Computer Sciences 1981, LNCS 118, p. 262–270, Springer-Verlag.

    Google Scholar 

  8. P.J. Downey; Formal languages and recursion schemes; Ph.D. Thesis, Rep. TR-16-74, Harvard University, Cambridge, Mass., 1974.

    Google Scholar 

  9. J. Duske, R. Parchmann; Linear indexed languages; TCS 32 (1984), 47–60.

    Google Scholar 

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

    Google Scholar 

  11. J. Engelfriet; Top-down tree transducers with regular look-ahead; Math. Syst. Theory 10 (1977), 289–303.

    Google Scholar 

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

    Google Scholar 

  13. J. Engelfriet; Three hierarchies of transducers; Math. Syst. Theory 15(1982), 95–125.

    Google Scholar 

  14. J. Engelfriet; Iterated pushdown automata and complexity classes; Proc. 15th STOC, April 1983, Boston, pp. 365–373.

    Google Scholar 

  15. J. Engelfriet; Context-free grammars with storage; Technical Report, Institute of Applied Mathematics and Computer Science, University of Leiden, The Netherlands.

    Google Scholar 

  16. J. Engelfriet, E.M. Schmidt; IO and OI; JCSS 15 (1977), 328–353 and JCSS 16 (1978), 67–99.

    Google Scholar 

  17. J. Engelfriet, G. Slutzki; Bounded nesting in macro grammars; Inf. and Contr. 42 (1979), 157–193.

    Google Scholar 

  18. J. Engelfriet, E.M. Schmidt, J. van Leeuwen; Stack machines and classes of non-nested macro grammars; JACM 27 (1980), 96–117.

    Google Scholar 

  19. J. Engelfriet, H. Vogler; Macro tree transducers; JCSS 31 (1985), 71–146.

    Google Scholar 

  20. J. Engelfriet, H. Vogler; Pushdown machines for the macro tree transducer; Report Nr. 84–13, Institute of Applied Mathematics and Computer Science, University of Leiden, to appear in TCS; see also: Regular characterizations of the macro tree transducer; in: "Ninth Colloquium on Trees in Algebra and Programming", March 1984, Bordeaux, France (ed. B. Courcelle), Cambridge University Press, 103–117.

    Google Scholar 

  21. J. Engelfriet, H. Vogler; High level tree transducers and iterated pushdown machines; Report Nr. 85–12, Institute of Applied Mathematics and Computer Science, University of Leiden, The Netherlands, May 1985,; see also: Characterization of high level tree transducers; Proc. of ICALP 1985, Nafplion, Greece.

    Google Scholar 

  22. J. Engelfriet, H. Vogler; Look-ahead on pushdowns; Report Nr. 85–14, Institute of Applied Mathematics and Computer Science, University of Leiden, The Netherlands, July 1985.

    Google Scholar 

  23. M.J. Fischer; Grammars with macro-like productions; Ph.D. Thesis, Harvard University, USA, 1968.

    Google Scholar 

  24. G. File; The characterization of some language families by classes of indexed grammars; M.Sc.Th., Dept. of Comp. Sci., Pennsylvania University Park, PA., 1977.

    Google Scholar 

  25. S. Ginsburg; "Algebraic and Automata-Theoretic Properties of Formal Languages"; North-Holland, Amsterdam, 1975.

    Google Scholar 

  26. S.A. Greibach; Full AFLs and nested iterated substitution; Inf. and Contr. 16 (1970), 7–35.

    Google Scholar 

  27. S.A. Greibach; Control sets on context-free grammar forms; JCSS 15 (1977), 35–98.

    Google Scholar 

  28. S.A. Greibach; One way finite visit automata; TCS 6 (1978), 175–221.

    Google Scholar 

  29. S. Ginsburg, E.H. Spanier; Finite-turn pushdown automata; SIAM Control 3 (1966), 429–453.

    Google Scholar 

  30. S. Ginsburg, E.H. Spanier; Control sets on grammars; Math. Syst. Theory 2 (1968), 159–177.

    Google Scholar 

  31. F. Gecseg, M. Steinby. "Tree automata", Akademiai Kiado, Budapest, 1984.

    Google Scholar 

  32. I. Guessarian; Pushdown tree automata; Math. Syst. Theory 16 (1983), 237–263.

    Google Scholar 

  33. J.E. Hopcroft, J.D. Ullman; "Formal languages and their relation to automata"; Addison-Wesley, Reading, Mass. 1979.

    Google Scholar 

  34. N.A. Khabbaz; A geometric hierarchy of languages; JCSS 8 (1974), 142–157.

    Google Scholar 

  35. N.A. Khabbaz; Control sets on linear grammars; Inf. and Contr. 25 (1974), 206–221.

    Google Scholar 

  36. A.N. Maslov; Multi-level stack automata; Probl. of Inf. Transm. 12 (1976), 38–43.

    Google Scholar 

  37. W.C. Rounds; Tree-oriented proofs of some theorems on context-free and indexed languages; 2nd Symposium on Theory of Computing (1970), 109–116.

    Google Scholar 

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

    Google Scholar 

  39. D. Scott; Some definitional suggestions for automata theory; JCSS 1 (1967), 187–212.

    Google Scholar 

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

    Google Scholar 

  41. J.W. Thatcher, J.B. Wright; Generalized finite automata theory with an application to a decision-problem of second-order logic; Math. Syst. Theory 2 (1968), 58–81.

    Google Scholar 

  42. H. Vogler; Iterated linear control and iterated one-turn pushdowns; Report Nr. 85–04, Institute of Applied Mathematics and Computer Science, University of Leiden, The Netherlands, March 1985; see also: Proc. of FCT 1985, Cottbus, GDR.

    Google Scholar 

  43. H. Vogler; The OI-hierarchy is closed under control; Report Nr. 85–20, Institute of Applied Mathematics and Computer Science, University of Leiden, The Netherlands, August 1985.

    Google Scholar 

  44. H. Vogler; Basic tree transducers; Report Nr.85–21, Institute of Applied Mathematics and Computer Science, University of Leiden, The Netherlands, October 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Leiden, P.O.Box 9512, 2300 RA, Leiden, The Netherlands

    Heiko Vogler

Authors
  1. Heiko Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Franchi-Zannettacci

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Vogler, H. (1986). Basic tree transducers. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022668

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16443-2

  • Online ISBN: 978-3-540-39783-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation