Acceptors for iteration languages

  • G. Rozenberg
  • D. Vermeir
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Herman, G.T. and Rozenberg, G., Developmental systems and languages, North-Holland Publishing Company, Amsterdam, 1975.Google Scholar
  2. 2.
    Leeuwen, J. van, Notes on pre-set pushdown automata, Lecture Notes in Computer Science, No.15:177–188. Springer Verlag, Heidelberg, 1974.Google Scholar
  3. 3.
    Rozenberg, G., On a family of acceptors for some classes of developmental languages, International Journal of Computer Mathematics, 4:199–228, 1974.Google Scholar
  4. 4.
    Rozenberg, G. and Salomaa, A., The mathematical theory of L systems, in J.T. Tou (ed.), Advances in Information Systems Science, 6, 161–206, 1976.Google Scholar
  5. 5.
    Rozenberg, G. and Wood, D., A note on a family of acceptors for some families of developmental languages, Department of Applied Mathematics, Mc Master University, Hamilton, Technical Report, No. 75-CS-7, 1975.Google Scholar
  6. 6.
    Salomaa, A., Parallelism in rewriting systems, Lecture Notes in Computer Science, Springer Verlag, Heidelberg, No. 14, 523–533, 1974.Google Scholar
  7. 7.
    Salomaa, A., Iteration grammars and Lindenmayer AFL's, Lecture Notes in Computer Science, Springer Verlag, Heidellberg, No. 15,250–253, 1974.Google Scholar
  8. 8.
    Savitch, W.J., Some characterizations of Lindenmayer systems in terms of Chomsky-type grammars and Stack-machines, Information and Control 27, 37–60, 1975.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1977

Authors and Affiliations

  • G. Rozenberg
    • 1
  • D. Vermeir
    • 2
  1. 1.Dept. of Math.University of Antwerp UIAWilrijkBelgium
  2. 2.Dept. T.E.W.University of Leuven, K.U.L.LeuvenBelgium

Personalised recommendations