Skip to main content
Log in

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

II. Nondeterministic systems

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Continuing the work begun in Part I of this paper, we consider now variations of nondeterministic OL-systems. The present Part II of the paper contains a systematic classification of the effect of nonterminals, codings, weak codings, nonerasing homomorphisms and homomorphisms for all basic variations of non-deterministic OL-languages, including table languages.

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

Access this article

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

Instant access to the full article PDF.

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)

Download references

Author information

Authors and Affiliations

Authors

Additional information

Part I of this paper appeared in Acta Informatica 4/1 (1974).

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 3, 357–364 (1974). https://doi.org/10.1007/BF00263589

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation