Synchronized bottom-up tree automata and L-systems

  • E. Fachini
  • M. Napoli
Colloquium On Trees In Algebra And Programming Graph Grammars And Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 185)


  1. (1).
    J. Engelfriet, Bottom-up and top-down tree transformations. A comparison, Math. Syst. Theory 9, 3(1975), 198–231.CrossRefGoogle Scholar
  2. (2).
    J. Engelfriet, Surface tree languages and parallel derivation trees, Theor. Comp. Sc. 2(1976), 9–27.CrossRefGoogle Scholar
  3. (3).
    J. Engelfriet, G. Rozenberg, G. Slutzki, Tree transducers, L-systems and two machines, J. C. S. S. 20(1980), 150,202.Google Scholar
  4. (4).
    J. van Leeuwen, Variations of a new machines model, Proc. 17th Annual Symp. Found. Comput. Sci., Houston, Texas (1976), 228–235.Google Scholar
  5. (5).
    M. C. Paull, S. H. Unger, Structural equivalence of context-free grammars, J. C. S. S. 2(1968), 427–463.Google Scholar
  6. (6).
    G. Rozenberg, A. Salomaa, The mathematical theory of L-systems, Academic Press, New York (1980).Google Scholar
  7. (7).
    J. W. Tatcher, Generalized sequential machines maps, J. C. S. S. 4 (1970), 339–367.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • E. Fachini
    • 1
  • M. Napoli
    • 1
  1. 1.Dipartimento di Informatica e ApplicazioniUniversita' di SalernoSalernoItaly

Personalised recommendations