Skip to main content

On some recent problems concerning developmental languages

  • Hauptvorträge
  • Conference paper
  • First Online:
GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A. (1968), Indexed grammars — an extension of context-free grammars, Journal of the Association for Computing Machinery 15, 647–671.

    Google Scholar 

  2. Berstel, J. (1972), Une remarque sur certains langages de Linden-mayer, unpublished manuscript.

    Google Scholar 

  3. Culik, K. II (1973), On some families of languages related to developmental systems, International Journal of Computer Mathematics, to appear.

    Google Scholar 

  4. Culik, K. II and Opatrny, J. (1973), Macro OL systems, submitted for publication.

    Google Scholar 

  5. Ehrenfeucht, A. and Rozenberg, G. (1973), Subwords in deterministic TOL systems, submitted for publication.

    Google Scholar 

  6. Ginsburg, S. and Rovan, B. (1973), Word length and DOL languages, submitted for publication.

    Google Scholar 

  7. Hayashi, T. (1972), On derivation trees of indexed grammars, an extension of the uvwxy-theorem, Kyoto University technical report RIMS-122.

    Google Scholar 

  8. Herman, G. (1973), Closure properties of some families of languages associated with biological systems, Information and Control, to appear.

    Google Scholar 

  9. Herman, G., Lee, K., Leeuwen, J.v. and Rozenberg, G. (1972), Characterization of unary developmental languages, Discrete Mathematics, to appear.

    Google Scholar 

  10. Leeuwen, J.v. (1973), Pre-set push-down automata, in preparation.

    Google Scholar 

  11. Leeuwen, J.v. (1972), A note on uniform Lindenmayer-languages, unpublished manuscript.

    Google Scholar 

  12. Lindenmayer, A. (1968), Mathematical models for cellular interactions in development, Parts I–II, Journal of Theoretical Biology 18, 280–315.

    Google Scholar 

  13. Paz, A. and Salomaa, A. (1973), Integral sequential word functions and growth equivalence of Lindenmayer systems, Information and Control, to appear.

    Google Scholar 

  14. Rozenberg, G. (1973), L-systems with interactions, Journal of Computer and System Sciences, to appear.

    Google Scholar 

  15. Rozenberg, G. (1973), TOL systems and languages, Information and Control, to appear.

    Google Scholar 

  16. Rozenberg, G. (1973), Extensions of tabled OL-systems and languages, submitted for publication.

    Google Scholar 

  17. Rozenberg, G. and Wood, D. (1973), Generative models for parallel processes, McMaster University, Computer Science technical report 73/6.

    Google Scholar 

  18. Salomaa, A. (1973), Formal Languages, Academic Press.

    Google Scholar 

  19. Salomaa, A. (1973), On exponential growth in Lindenmayer systems, Indagationes Mathematicae 35, 23–30.

    Google Scholar 

  20. Salomaa, A. (1973), On sentential forms of context-free grammars, Acta Informatica 2, 40–49.

    Google Scholar 

  21. Salomaa, A. (1973), Solution of a decision problem concerning unary Lindenmayer systems, submitted for publication.

    Google Scholar 

  22. Szilard, A. (1971), Growth functions of Lindenmayer systems, submitted for publication.

    Google Scholar 

  23. Vitanyi, P. (1973), Structure of growth in Lindenmayer systems, technical report No. 1/73, Mathematisch Centrum, Amsterdam.

    Google Scholar 

  24. Vitanyi, P. (1973), Growth of strings in parallel rewriting systems, unpublished manuscript.

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag

About this paper

Cite this paper

Salomaa, A. (1973). On some recent problems concerning developmental languages. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039135

Download citation

  • DOI: https://doi.org/10.1007/BFb0039135

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06527-2

  • Online ISBN: 978-3-540-37826-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics