Skip to main content

Advertisement

SpringerLink
Log in

Doubly deterministic tabled OL systems

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

Abstract

A tabled OL system is doubly deterministic if its tables (developmental programs) are deterministic and its choice of table is also deterministic. Numerous results on DDTOL systems are presented, mainly decidability results. The putative biological importance of the model is also discussed and its choice motivated.

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. K. Culik, II, “The decidability ofv-local catenativity and of other problems of DOL systems,”Inf. Process. Lett. 7(1):33–35 (1978).

    Google Scholar 

  2. A. Ehrenfeucht and G. Rozenberg, “On Simplifications of PDOL Systems,” Proceedings of the Conference on Theoretical Computer Science, Waterloo (1977), pp. 81–87.

  3. G. T. Herman and G. Rozenberg,Developmental Systems and Languages (North-Holland, New York, 1975).

    Google Scholar 

  4. A. Lindenmayer, “Adding Continuous Components toL-Systems,” inL-Systems, G. Rozenberg and A. Salomaa, eds. (Springer-Verlag, New York, 1974), pp. 53–68.

    Google Scholar 

  5. A. Lindenmayer, personal communications (1977).

  6. A. Lindenmayer and G. Rozenberg, eds.,Automatic, languages, development, At the crossroads of biology, mathematics and computer science (North-Holland, New York, 1976).

    Google Scholar 

  7. G. Rozenberg, “The equivalence problem for deterministic TOL systems is undecidable,”Inf. Process. Lett. 1:201–204, errata, 252 (1972).

    Google Scholar 

  8. G. Rozenberg, “TOL systems and languages,”Inf. Control 23:357–381 (1973).

    Google Scholar 

  9. G. Rozenberg and A. Lindenmayer, “Developmental systems with locally catenative formulas,”Acta Inf. 2:214–248 (1973).

    Google Scholar 

  10. G. Rozenberg and A. Salomaa, “The Mathematical Theory ofL Systems,” Chapter 4in Advances in Information Systems Science, Vol. 6, J. Tou, ed. (Plenum Press, New York, 1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada

    K. Culik II

  2. Unit for Computer Science, McMaster University, L8S 4K1, Hamilton, Ontario, Canada

    D. Wood

Authors
  1. K. Culik II
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Wood
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Work carried out partially under the auspices of the Universities of Antwerpen, Karlsruhe, and Utrecht and partially under Natural Sciences and Engineering Research Council of Canada Grants Nos. A-7403 and A-7700.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Culik, K., Wood, D. Doubly deterministic tabled OL systems. International Journal of Computer and Information Sciences 8, 335–347 (1979). https://doi.org/10.1007/BF00993057

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation