This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, Indexed grammars: an extension of the context free case, JACM 15 (1968), 647–671.
A. Arnold, M. Dauchet, Transductions de forêts reconnaissables monadiques. Forêts corégulières, RAIRO Inf. Théor. 10 (1976), 5–28.
J. Bilstein, W. Damm, Top-down tree transducers for infinite trees, this Conference.
G. Boudol, Langages algébriques d'arbres, LITP Report, to appear.
B. Courcelle, On jump deterministic pushdown automata, MST 11 (1977), 87–109.
W. Damm, The IO and OI hierarchies, Thesis, Report no41 (1980), RWTH Aachen.
W. Damm, I. Guessarian, Combining T and n, submitted for publication.
P. Downey, Formal languages and recursion schemes, Ph. D. Harvard (1974).
J. Engelfriet, Bottom-up and top-down tree transformations. A comparison. MST 9 (1975), 198–231.
J. Engelfriet, Some open questions and recent results on tree transducers and tree languages, Proc. Int. Symp. on For. Lang. Theor., Santa Barbara, Academic Press, to appear.
J. Engelfriet, E.M. Schmidt, IO and OI, JCSS 15 (1977), 328–353, and JCSS 16 (1978), 67–99.
M.J. Fischer, Grammars with macro-like productions, 9th SWAT (1968), 131–142.
J.H. Gallier, Alternate proofs and new results about recursion schemes and DPDA's, Report MS-CIS-80-7, Dpt of Comp. Sc., Univ. of Pennsylvania (1980), to appear.
I. Guessarian, Algebraic semantics, Lect. Notes in Comp. Sc. no99, Springer-Verlag, Berlin (1981).
M. Nivat, On the interpretation of recursive polyadic program schemes, Symp. Mat. 15, Rome (1975), 255–281.
N. Polian, Langages infinis engendrés par les grammaires algébriques d'arbres, Th. 3ème Cycle, in preparation, Poitiers (1981).
M. Rabin, Automata on infinite objects and Church's problem, CBSM regional Conf. series in Math. no13, AMS (1969).
W.C. Rounds, Mappings and grammars on trees, MST 4 (1970), 257–287.
J.M. Steyaert, Lemmes d'itération pour les familles d'arbres, Actes du Séminaire d'Inf. Théor. 1977–1978, LITP Report, Paris (1979).
J.W. Thatcher, Tree automata: an informal survey, in Currents in Theory of Comp., Aho (ed.), Prentice-Hall, London (1973).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guessarian, I. (1981). On pushdown tree automata. In: Astesiano, E., Böhm, C. (eds) CAAP '81. CAAP 1981. Lecture Notes in Computer Science, vol 112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10828-9_64
Download citation
DOI: https://doi.org/10.1007/3-540-10828-9_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10828-3
Online ISBN: 978-3-540-38716-9
eBook Packages: Springer Book Archive