Chapter PDF
References
J. Engelfriet, Bottom-up and top-down tree transformations. A comparison, Math. Syst. Theory 9, 3(1975), 198–231.
J. Engelfriet, Surface tree languages and parallel derivation trees, Theor. Comp. Sc. 2(1976), 9–27.
J. Engelfriet, G. Rozenberg, G. Slutzki, Tree transducers, L-systems and two machines, J. C. S. S. 20(1980), 150,202.
J. van Leeuwen, Variations of a new machines model, Proc. 17th Annual Symp. Found. Comput. Sci., Houston, Texas (1976), 228–235.
M. C. Paull, S. H. Unger, Structural equivalence of context-free grammars, J. C. S. S. 2(1968), 427–463.
G. Rozenberg, A. Salomaa, The mathematical theory of L-systems, Academic Press, New York (1980).
J. W. Tatcher, Generalized sequential machines maps, J. C. S. S. 4 (1970), 339–367.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fachini, E., Napoli, M. (1985). Synchronized bottom-up tree automata and L-systems. In: Ehrig, H., Floyd, C., Nivat, M., Thatcher, J. (eds) Mathematical Foundations of Software Development. CAAP 1985. Lecture Notes in Computer Science, vol 185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15198-2_19
Download citation
DOI: https://doi.org/10.1007/3-540-15198-2_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15198-2
Online ISBN: 978-3-540-39302-3
eBook Packages: Springer Book Archive