Skip to main content
SpringerLink
Log in

Nonterminals, homomorphisms and codings in different variations of OL-systems

I. Deterministic systems

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The use of nonterminals versus the use of homomorphisms of different kinds in the basic types of deterministic OL-systems is studied. A rather surprising result is that in some cases the use of nonterminals produces a comparatively low generative capacity, whereas in some other cases the use of nonterminals gives a very high generative capacity. General results are obtained concerning the use of erasing productions versus the use of erasing homomorphisms. The paper contains a systematic classification of the effect of nonterminals, codings, weak codings, nonerasing homomorphisms and homomorphisms for all basic types of deterministic OL-languages, including table languages.

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. Čulik, K. II, Opatrny, J.: Literal homomorphisms of OL-languages. University of Waterloo, Research Report CS-73-25, 1973

  2. Ehrenfeucht, A., Rozenberg, G.: The equality of EOL-languages and codings of OL-languages. To appear in: International J. Computer Mathematics

  3. Ehrenfeucht, A., Rozenberg, G.: Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems. Acta Informatica 3, 265–283 (1974)

    Google Scholar 

  4. Herman, G., Rozenberg, G.: Developmental Systems and Languages. Amsterdam: North-Holland (to appear)

  5. Lindenmayer, A., Rozenberg, G.: Developmental systems with locally catenative formulas. Acta Informatica 2, 214–248 (1973)

    Google Scholar 

  6. Nielsen, M.: The decidability of some equivalence problems for DOL-systems. Information and Control 25, 166–193 (1974)

    Google Scholar 

  7. Paz, A., Salomaa, A.: Integral sequential word functions and growth equivalence of Lindenmayer systems. Information and Control 23, 313–343 (1973)

    Google Scholar 

  8. Salomaa, A.: Formal languages. London-New York: Academic Press 1973

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, University of Utrecht, Utrecht, The Netherlands

    G. Rozenberg

  2. Computer Science Department, University of Aarhus, DK-8000, Aarhus, Denmark

    M. Nielsen, A. Salomaa & S. Skyum

Authors
  1. M. Nielsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. S. Skyum
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nielsen, M., Rozenberg, G., Salomaa, A. et al. Nonterminals, homomorphisms and codings in different variations of OL-systems. Acta Informatica 4, 87–106 (1974). https://doi.org/10.1007/BF00288938

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation