This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Engelfriet, J., Top-down tree transducers with regular look-ahead, Math. Systems Theory 10 (1977), 289–303.
Engelfriet, J. and Vogler, H., Pushdown machines for the macro tree transducer, Theoret. Comput. Sci. 42 (1986), 251–368
Fülöp, Z. and Vágvölgyi, S., Variants of top-down tree transducers with look-ahead, Math. Systems Theory, to appear
Gécseg, F. and Steinby, M., Tree Automata, Akadémiai Kiadó, Budapest, 1984.
Khabbaz, N.A., A geometric hierarchy of languages, J. Comput. System. Sci. 8 (1974), 142–157.
Khabbaz, N.A., Control sets on linear grammars, Inform. Control 25 (1974), 206–221.
Vogler, H., Basic Tree Transducers, J. Comput. System Sci. 34 (1987), 87–128.
Vogler, H., Iterated linear control and iterated one-turn pushdowns, Math. Systems Theory 19 (1986), 117–133.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fülöp, Z., Vágvölgyi, S. (1989). Iterated deterministic top-down look-ahead. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_17
Download citation
DOI: https://doi.org/10.1007/3-540-51498-8_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51498-5
Online ISBN: 978-3-540-48180-5
eBook Packages: Springer Book Archive