Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho; Indexed grammars, an extension of context-free grammars; JACM 15 (1968), 647–671.
A.V. Aho; Nested stack automata; JACM 16 (1969), 383–406.
B. Courcelle; A representation of trees by languages I and II; TCS 6 (1978), 255–279 and TCS 7 (1978), 25–55.
B. Courcelle, P. Franchi-Zannettacci; Attribute grammars and recursive program schemes I, II; TCS 17 (1982), 163–191 and TCS 17 (1982), 235–257.
W. Damm; The IO-and OI-hierarchies; TCS 20 (1982), 95–206.
W. Damm, A. Goerdt; An automata-theoretic characterization of the OI-hierarchy; Proc. 9th ICALP, 1982, Aarhus, pp. 141–153.
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.
P.J. Downey; Formal languages and recursion schemes; Ph.D. Thesis, Rep. TR-16-74, Harvard University, Cambridge, Mass., 1974.
J. Duske, R. Parchmann; Linear indexed languages; TCS 32 (1984), 47–60.
J. Engelfriet; Bottom-up and top-down tree transformations — a comparison; Math. Syst. Theory 9 (1975), 198–231.
J. Engelfriet; Top-down tree transducers with regular look-ahead; Math. Syst. Theory 10 (1977), 289–303.
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.
J. Engelfriet; Three hierarchies of transducers; Math. Syst. Theory 15(1982), 95–125.
J. Engelfriet; Iterated pushdown automata and complexity classes; Proc. 15th STOC, April 1983, Boston, pp. 365–373.
J. Engelfriet; Context-free grammars with storage; Technical Report, Institute of Applied Mathematics and Computer Science, University of Leiden, The Netherlands.
J. Engelfriet, E.M. Schmidt; IO and OI; JCSS 15 (1977), 328–353 and JCSS 16 (1978), 67–99.
J. Engelfriet, G. Slutzki; Bounded nesting in macro grammars; Inf. and Contr. 42 (1979), 157–193.
J. Engelfriet, E.M. Schmidt, J. van Leeuwen; Stack machines and classes of non-nested macro grammars; JACM 27 (1980), 96–117.
J. Engelfriet, H. Vogler; Macro tree transducers; JCSS 31 (1985), 71–146.
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.
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.
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.
M.J. Fischer; Grammars with macro-like productions; Ph.D. Thesis, Harvard University, USA, 1968.
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.
S. Ginsburg; "Algebraic and Automata-Theoretic Properties of Formal Languages"; North-Holland, Amsterdam, 1975.
S.A. Greibach; Full AFLs and nested iterated substitution; Inf. and Contr. 16 (1970), 7–35.
S.A. Greibach; Control sets on context-free grammar forms; JCSS 15 (1977), 35–98.
S.A. Greibach; One way finite visit automata; TCS 6 (1978), 175–221.
S. Ginsburg, E.H. Spanier; Finite-turn pushdown automata; SIAM Control 3 (1966), 429–453.
S. Ginsburg, E.H. Spanier; Control sets on grammars; Math. Syst. Theory 2 (1968), 159–177.
F. Gecseg, M. Steinby. "Tree automata", Akademiai Kiado, Budapest, 1984.
I. Guessarian; Pushdown tree automata; Math. Syst. Theory 16 (1983), 237–263.
J.E. Hopcroft, J.D. Ullman; "Formal languages and their relation to automata"; Addison-Wesley, Reading, Mass. 1979.
N.A. Khabbaz; A geometric hierarchy of languages; JCSS 8 (1974), 142–157.
N.A. Khabbaz; Control sets on linear grammars; Inf. and Contr. 25 (1974), 206–221.
A.N. Maslov; Multi-level stack automata; Probl. of Inf. Transm. 12 (1976), 38–43.
W.C. Rounds; Tree-oriented proofs of some theorems on context-free and indexed languages; 2nd Symposium on Theory of Computing (1970), 109–116.
W.C. Rounds; Mappings and grammars on trees; Math. Syst. Theory 4 (1970), 257–287.
D. Scott; Some definitional suggestions for automata theory; JCSS 1 (1967), 187–212.
J.W. Thatcher; Generalized2 sequential machine maps; JCSS 4 (1970), 339–367.
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.
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.
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.
H. Vogler; Basic tree transducers; Report Nr.85–21, Institute of Applied Mathematics and Computer Science, University of Leiden, The Netherlands, October 1985.
Author information
Authors and Affiliations
Editor information
Rights 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