Skip to main content
SpringerLink
Log in

Extension of tabled 0L-systems and languages

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

This paper introduces a new family of languages which originated from a study of some mathematical models for the development of biological organisms. Various properties of this family are established and in particular it is proved that it forms a full abstract family of languages. It is compared with some other families of languages which have already been studied and which either originated from the study of models for biological development or belong to the now standard Chomsky hierarchy. A characterization theorem for context-free languages is also established.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Baker and G. T. Herman, “Simulation of organisms using a developmental model, Parts I and II,”Int. J. Bio-Med. Comp., to appear.

  2. E. F. Codd,Cellular Automata (Academic Press, New York, 1968).

    Google Scholar 

  3. D. van Dalen, “A note on some systems of Lindenmayer,”Math. Systems Theory 5:128–140 (1971).

    Google Scholar 

  4. P. Doucet, “On the membership question in some Lindenmayer systems,”Indag. Math. 34:45–52 (1972).

    Google Scholar 

  5. H. Feliciangeli and G. T. Herman, “Algorithms for producing grammars from sample derivations,”J. Comp. Syst. Sci., to appear.

  6. S. Ginsburg,The Mathematical Theory of Context-Free Languages (McGraw-Hill, New York, 1966).

    Google Scholar 

  7. S. Ginsburg and S. Greibach, “Abstract families of languages,”Mem. Am. Math. Soc. 87:1–32 (1969).

    Google Scholar 

  8. G. T. Herman, “The computing ability of a developmental model for filamentous organisms,”J. Theoret. Biol. 25:421–435 (1969).

    Google Scholar 

  9. G. T. Herman, “The role of environment in developmental models,”J. Theoret. Biol. 29:329–341 (1970.

    Google Scholar 

  10. G. T. Herman, “Models for cellular interactions in development without polarity of individual cells, Parts I and II.”Int. J. Systems Sci. 2:271–289 (1971):3:149–175 (1972).

    Google Scholar 

  11. G. T. Herman, “Closure properties of families of languages associated with biological systems,” submitted to a technical journal, abstract inProc. 5th Annual Princeton Conf. Inf. Sciences Syst., 1971.

  12. G. T. Herman, “Polar organisms with apolar individual cells,” inProc. Int. Congr. on Logic, Math, and Phil, of Science, 1971.

  13. G. T. Herman, “The syntactic inference problem as applied to biological systems,” to appear inMachine Intelligence 7.

  14. G. T. Herman, “A biologically motivated extension of Algol-like languages,” to appear inInformation and Control.

  15. G. T. Herman, K. P. Lee, J. van Leeuwen, and G. Rozenberg, “Characterization of unary developmental languages,” to appear inDiscrete Mathematics.

  16. G. T. Herman, A. Lindenmayer, and G. Rozenberg, “Description of developmental systems using recurrence systems,” submitted to a technical journal.

  17. J. E. Hopcroft and J. D. Ullman,Formal Languages and Their Relation to Automata (Addison-Wesley, Reading, Mass., 1969).

    Google Scholar 

  18. A. Lindenmayer, “Mathematical models for cellular interactions in development, Parts I and II,”J. Theoret. Biol. 18:280–315 (1968).

    Google Scholar 

  19. A. Lindenmayer, “Developmental systems without cellular interactions, their languages and grammars,”J. Theoret. Biol. 30:455–484 (1971).

    Google Scholar 

  20. A. Lindenmayer, “Cellular automata, formal languages and developmental systems,” inProc. Int. Congr. on Logic, Math, and Phil, of Science, 1971.

  21. A. Lindenmayer and G. Rozenberg, “Developmental systems and languages,” inProc. 4th ACM Symp. Theory Comp. (1972), pp. 214–221.

  22. A. Paz and A. Salomaa, “Integral sequential word functions and growth equivalence of Lindenmayer systems,” submitted to a technical journal.

  23. D. J. Rosenkrantz, “Programmed grammars and classes of formal languages,”J. Assoc. Comp. Mach. 16:107–131 (1969).

    Google Scholar 

  24. G. Rozenberg, “TOL systems and languages,” to appear inInformation and Control.

  25. G. Rozenberg, “OnQL languages with restricted use of productions,” to appear inJ. Comp. Syst. Sci.

  26. G. Rozenberg, “The equivalence problem for deterministic TOL-systems is undecidable,”Inf. Processing Letters,1:201–204 (1972).

    Google Scholar 

  27. G. Rozenberg, “Z-systems with interactions,” to appear inJ. Comp. Syst. Sci.

  28. G. Rozenberg, “DOL sequences,” submitted to a technical journal.

  29. G. Rozenberg, “Circularities inDOL sequences,” to appear inRevue Raum, de Math. Pures et Appl.

  30. G. Rozenberg, “Direct proofs of the unsolvability of the equivalence problem for sentential forms of context-free grammars and the equivalence problem forQL systems,” to appear inInf. Processing Letters.

  31. G. Rozenberg, “On a machine model forL-systems without interactions,” submitted to a technical journal.

  32. G. Rozenberg and P. Doucet, “On OL languages,”Information and Control 19:302–318 (1971).

    Google Scholar 

  33. G. Rozenberg and K. P. Lee, “Some properties of the class ofL-languages with interactions,” submitted to a technical journal.

  34. G. Rozenberg and K. P. Lee, “Developmental systems with finite axiom sets, Parts I and II,” submitted to a technical journal.

  35. G. Rozenberg and A. Lindenmayer, “Developmental systems with locally catenative formulas,” submitted to a technical journal.

  36. V. Surapipith and A. Lindenmayer, “Thioquanine-dependent light sensitivity of Perithecial initiation in Sordia flmicola,”J. Gen. Microb. 57:227–237 (1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York at Buffalo, Amherst, New York

    Grzegorz Rozenberg

  2. Mathematical Institute, Utrecht University, Utrecht-Uithof, Netherlands

    Grzegorz Rozenberg

Authors
  1. Grzegorz Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research has been supported by NSF Grant GJ 998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rozenberg, G. Extension of tabled 0L-systems and languages. International Journal of Computer and Information Sciences 2, 311–336 (1973). https://doi.org/10.1007/BF00985664

Download citation

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation