Skip to main content
SpringerLink
Log in

Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Given a rewriting system G (its alphabet, the set of productions and the axiom) one can define the language of G by

  1. (i)

    taking out of all strings generated by G only those which are over a distinguished subalphabet of G, or

  2. (ii)

    translating the set of all strings generated by G by a fixed homomorphism.

The “trade-offs” between these two mechanisms for defining languages are discussed for both “parallel” rewriting systems from the developmental systems hierarchy and “sequential” rewriting systems from the Chomsky hierarchy.

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. Balzer, R.: The firing squad synchronization problem. Information and Control 10, 22–42 (1967)

    Google Scholar 

  2. Chomsky, N.: Three models for the description of language. IRE Trans. Inform. Theory IT2, 113–124 (1956)

    Google Scholar 

  3. Chomsky, N.: Syntactic Structures. The Hague: Mouton and Company 1957

    Google Scholar 

  4. Davis, M.: Computability and Unsolvability. New York: McGraw-Hill 1958

    Google Scholar 

  5. van Dalen, D.: A note on some systems of Lindenmayer. Mathematical Systems Theory 5, 128–140 (1971)

    Google Scholar 

  6. Ehrenfeucht, A., Rozenberg, G.: The equality of EOL languages and codings of OL languages. International J. Computer Mathematics, to appear

  7. Ginsburg, S., Greibach, S.: Abstract families of languages. IEEE Conf. Record on 8th Annual Symp. on Switching and Automata Theory, 1967

  8. Herman, G.: The computing ability of a developmental model for filamentous organisms. J. Theoretical Biology 25, 421–435 (1969)

    Google Scholar 

  9. Herman, G.: Closure properties of some families of languages associated with biological systems. Information and Control 24, 101–121 (1974)

    Google Scholar 

  10. Herman, G., Lindenmayer, A., Rozenberg, G.: Description of developmental languages using recurrence systems, Mathematical Systems Theory, to appear

  11. Herman, G., Rozenberg, G.: Developmental systems and languages, to be published by North-Holland Publishing Company. 1974

  12. Herman, G., Liu, W., Rowland, S., Walker, A.: Synchronization of growing cellular arrays. Quarterly Bulletin of the Center for Theoretical Biology, SUNY at Buffalo 5, 143–196 (1972)

    Google Scholar 

  13. Hopcroft, J., Ullman, J.: Formal languages and their relation to automata. Reading (Mass.): Addison-Wesley 1969

    Google Scholar 

  14. Lindenmayer, A.: Mathematical models for cellular interactions in development. J. Theoretical Biology 18, 300–315 (1968)

    Google Scholar 

  15. Lindenmeyer, A., Rozenberg, G.: Developmental systems and languages. Proc. of the 4th Annual ACM Symposium on Theory of Computing, Denver (Col.) 1972

  16. Paz, A., Salomaa, A.: Integral sequential word function and growth equivalence of Lindenmayer Systems. Information and Control 23, 313–343 (1973)

    Google Scholar 

  17. Rozenberg, G.: Extension of tabled OL systems and languages. International J. Computer and Information Sciences 2, 311–334 (1973)

    Google Scholar 

  18. Rozenberg, G.: TOL systems and languages. Information and Control 23, 357–381 (1973)

    Google Scholar 

  19. Rozenberg, G., Doucet, P.: On OL languages. Information and Control 19, 302–318 (1971)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Colorado, 80302, Boulder, Colorado, USA

    A. Ehrenfeucht

  2. Institute of Mathematics University of Utrecht, Utrecht-Uithof, The Netherlands

    G. Rozenberg

  3. Department of Mathematics, Antwerp University, UIA, Wilrijk, Belgium

    G. Rozenberg

Authors
  1. A. Ehrenfeucht
    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

Rights and permissions

Reprints and permissions

About this article

Cite this article

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

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation