Chapter 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.
A.V. Aho, J.D. Ullman: Translations on a context-free grammar; Inf. and Control 19 (1971), 439–475.
P.R.J. Asveld: Controlled iteration grammars and full hyper-AFL's; to appear in Inf. and Control.
P.R.J. Asveld, J. Engelfriet: Iterated deterministic substitution; to appear in Acta Informatica.
P.R.J. Asveld, J. Engelfriet: work in progress.
B.S. Baker: Tree transductions and families of tree languages; 5th Theory of Computing (1973), 200–206.
P.A. Christensen: Hyper-AFLs and ETOL systems; in "L Systems" (eds. G. Rozenberg, A. Salomaa), LNCS 15, 1974.
P.J. Downey: Formal languages and recursion schemes; Harvard University, Report TR-16-74, 1974.
A. Ehrenfeucht, G. Rozenberg, S. Skyum: A relationship between ETOL and EDTOL languages; Theoretical Computer Science 1 (1976), 325–330.
J. Engelfriet: Bottom-up and top-down tree transformations-a comparison; Math. Syst. Theory 9(1975), 198–231.
J. Engelfriet: Surface tree languages and parallel derivation trees; Theor. Comp. Sci. 2 (1976), 9–27.
J. Engelfriet, J. van Leeuwen, E. Meineche Schmidt: Stack automata and classes of nonnested macro languages; in preparation.
J. Engelfriet, E. Meineche Schmidt: IO and OI; DAIMI PB-47, University of Aarhus, Denmark, 1975, to appear in JCSS.
J. Engelfriet, S. Skyum: Copying theorems; Inf. Proc. Letters 4(1976), 157–161.
M.J. Fischer: Grammars with macro-like productions; Doctoral Diss., Harvard University, 1968 (also: 9th SWAT, 131–142).
S. Ginsburg: "Algebraic and automata-theoretic properties of formal languages"; North-Holland, Amsterdam, 1975.
S. Ginsburg, S. Greibach, M. Harrison: One-way stack automata; JACM 14(1967), 389–418.
S. Greibach: Checking automata and one-way stack languages; JCSS 3(1969), 196–217.
S. Greibach: Full AFLs and nested iterated substitution; Inf. and Control 16(1970), 7–35.
D.I. Kiel: Two-way a-transducers and AFL; JCSS 10(1975), 88–109.
J. van Leeuwen: Variations of a new machine model; 17th Ann. Symp. on Mathematical foundations of Computer Science, October 1976.
W. Ogden: Intercalation theorems for stack languages; 1st ACM Symposium on Theory of Computing, 1969, pp. 31–42.
C.R. Perrault: Intercalation lemmas for tree transducer languages; JCSS 13(1976), 246–277.
W.C. Rounds: Mappings and grammars on trees; Math. Syst. Theory 4(1970), 257–287.
A. Salomaa: Macros, iterated substitution and Lindenmayer AFLs; DAIMI PB-18, University of Aarhus, Denmark, 1973. See also: Iteration grammars and Lindenmayer AFLs; in "L-systems" (ed. G. Rozenberg, A. Salomaa), LNCS 15, 1974.
S. Skyum: Decomposition theorems for various kinds of languages parallel in nature; SIAM J. Comp. 5(1976), 284–296.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelfriet, J. (1977). Macro grammars, lindenmayer systems and other copying devices. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive