Advertisement

Acta Informatica

, Volume 3, Issue 4, pp 357–364 | Cite as

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

II. Nondeterministic systems
  • M. Nielsen
  • G. Rozenberg
  • A. Salomaa
  • S. Skyum
Article

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.

Keywords

Information System Operating System Data Structure Communication Network Systematic Classification 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Čulik, K. II, Opatrny, J.: Literal homomorphisms of OL-languages. University of Waterloo, Research Report CS-73-25, 1973Google Scholar
  2. 2.
    Ehrenfeucht, A., Rozenberg, G.: The equality of EOL-languages and codings of OL-languages. To appear in International J. Computer MathematicsGoogle Scholar
  3. 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. 4.
    Herman, G., Rozenberg, G.: Developmental systems and languages. Amsterdam: North-Holland (to appear)Google Scholar

Copyright information

© Springer-Verlag 1974

Authors and Affiliations

  • M. Nielsen
    • 1
  • G. Rozenberg
    • 2
  • A. Salomaa
    • 1
  • S. Skyum
    • 1
  1. 1.Department of Computer ScienceUniversity of AarhusAarhus CDenmark
  2. 2.Mathematics DepartmentUniversity of UtrechtUtrechtThe Netherlands

Personalised recommendations