Macro grammars, lindenmayer systems and other copying devices

  • Joost Engelfriet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


  1. [1]
    A.V. Aho: Indexed grammars — An extension of context-free grammars; JACM 15 (1968), 647–671.Google Scholar
  2. [2]
    A.V. Aho: Nested stack automata; JACM 16 (1969), 383–406.Google Scholar
  3. [3]
    A.V. Aho, J.D. Ullman: Translations on a context-free grammar; Inf. and Control 19 (1971), 439–475.Google Scholar
  4. [4]
    P.R.J. Asveld: Controlled iteration grammars and full hyper-AFL's; to appear in Inf. and Control.Google Scholar
  5. [5]
    P.R.J. Asveld, J. Engelfriet: Iterated deterministic substitution; to appear in Acta Informatica.Google Scholar
  6. [6]
    P.R.J. Asveld, J. Engelfriet: work in progress.Google Scholar
  7. [7]
    B.S. Baker: Tree transductions and families of tree languages; 5th Theory of Computing (1973), 200–206.Google Scholar
  8. [8]
    P.A. Christensen: Hyper-AFLs and ETOL systems; in "L Systems" (eds. G. Rozenberg, A. Salomaa), LNCS 15, 1974.Google Scholar
  9. [9]
    P.J. Downey: Formal languages and recursion schemes; Harvard University, Report TR-16-74, 1974.Google Scholar
  10. [10]
    A. Ehrenfeucht, G. Rozenberg, S. Skyum: A relationship between ETOL and EDTOL languages; Theoretical Computer Science 1 (1976), 325–330.Google Scholar
  11. [11]
    J. Engelfriet: Bottom-up and top-down tree transformations-a comparison; Math. Syst. Theory 9(1975), 198–231.Google Scholar
  12. [12]
    J. Engelfriet: Surface tree languages and parallel derivation trees; Theor. Comp. Sci. 2 (1976), 9–27.Google Scholar
  13. [13]
    J. Engelfriet, J. van Leeuwen, E. Meineche Schmidt: Stack automata and classes of nonnested macro languages; in preparation.Google Scholar
  14. [14]
    J. Engelfriet, E. Meineche Schmidt: IO and OI; DAIMI PB-47, University of Aarhus, Denmark, 1975, to appear in JCSS.Google Scholar
  15. [15]
    J. Engelfriet, S. Skyum: Copying theorems; Inf. Proc. Letters 4(1976), 157–161.Google Scholar
  16. [16]
    M.J. Fischer: Grammars with macro-like productions; Doctoral Diss., Harvard University, 1968 (also: 9th SWAT, 131–142).Google Scholar
  17. [17]
    S. Ginsburg: "Algebraic and automata-theoretic properties of formal languages"; North-Holland, Amsterdam, 1975.Google Scholar
  18. [18]
    S. Ginsburg, S. Greibach, M. Harrison: One-way stack automata; JACM 14(1967), 389–418.Google Scholar
  19. [19]
    S. Greibach: Checking automata and one-way stack languages; JCSS 3(1969), 196–217.Google Scholar
  20. [20]
    S. Greibach: Full AFLs and nested iterated substitution; Inf. and Control 16(1970), 7–35.Google Scholar
  21. [21]
    D.I. Kiel: Two-way a-transducers and AFL; JCSS 10(1975), 88–109.Google Scholar
  22. [22]
    J. van Leeuwen: Variations of a new machine model; 17th Ann. Symp. on Mathematical foundations of Computer Science, October 1976.Google Scholar
  23. [23]
    W. Ogden: Intercalation theorems for stack languages; 1st ACM Symposium on Theory of Computing, 1969, pp. 31–42.Google Scholar
  24. [24]
    C.R. Perrault: Intercalation lemmas for tree transducer languages; JCSS 13(1976), 246–277.Google Scholar
  25. [25]
    W.C. Rounds: Mappings and grammars on trees; Math. Syst. Theory 4(1970), 257–287.Google Scholar
  26. [26]
    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.Google Scholar
  27. [27]
    S. Skyum: Decomposition theorems for various kinds of languages parallel in nature; SIAM J. Comp. 5(1976), 284–296.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Joost Engelfriet
    • 1
  1. 1.Twente University of TechnologyEnschedeThe Netherlands

Personalised recommendations