Advertisement

Acta Informatica

, Volume 4, Issue 1, pp 87–106 | Cite as

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

I. Deterministic systems
  • M. Nielsen
  • G. Rozenberg
  • A. Salomaa
  • S. Skyum
Article

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.

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
  5. 5.
    Lindenmayer, A., Rozenberg, G.: Developmental systems with locally catenative formulas. Acta Informatica 2, 214–248 (1973)Google Scholar
  6. 6.
    Nielsen, M.: The decidability of some equivalence problems for DOL-systems. Information and Control 25, 166–193 (1974)Google Scholar
  7. 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. 8.
    Salomaa, A.: Formal languages. London-New York: Academic Press 1973Google Scholar

Copyright information

© Springer-Verlag 1974

Authors and Affiliations

  • M. Nielsen
    • 2
  • G. Rozenberg
    • 1
  • A. Salomaa
    • 2
  • S. Skyum
    • 2
  1. 1.Mathematics DepartmentUniversity of UtrechtUtrechtThe Netherlands
  2. 2.Computer Science DepartmentUniversity of AarhusAarhusDenmark

Personalised recommendations