Skip to main content
SpringerLink
Log in

Context-free grammars with selective rewriting

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Selective substitution grammars first introduced by Rozenberg are further investigated. In particular we study ‘context-free grammars’ with selection, since the original model is too general in its generative power. It is shown how the families of context-free, EOL and ETOL languages can be characterized by selective context-free grammars. Further the effect of linguistic restrictions on the family of selection languages is investigated. Finally, the notion of a universal grammar is investigated in this framework, demonstrating the existence of selection universal grammars under weak conditions on the selection family.

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. Gabrielian, A.: Pure grammars and pure languages. University of Waterloo, C. Sc. Report 2027 (1970)

  2. Greibach, S.A.: Comments on universal and left universal grammars, context-sensitive languages and context-free grammar forms. Information and Control 39, 135–142 (1978)

    Google Scholar 

  3. Hart, J.M.: Two extension of Kasai's universal context-free grammar. University of Kentucky, Computer Science TR 22–75, 1976

  4. Herman, G.T., Rozenberg, G.: Developmental systems and languages. Amsterdam: North-Holland 1975

    Google Scholar 

  5. Kasai, T.: A universal context-free grammar. Information and Control 28, 30–34 (1975)

    Google Scholar 

  6. Liu, L.Y., Wiener, P.: An infinite hierarchy of intersections of context-free languages. Computer Science Lab. TR No. 65, Princeton (1968)

  7. Maurer, H.A., Salomaa, A., Wood, D.: Pure grammars, Information and Control (in press, 1979)

  8. Rozenberg, G.: A note on universal grammars. Information and Control 34, 172–175 (1977)

    Google Scholar 

  9. Rozenberg, G.: Selective substitution grammars (towards a framework for rewriting systems) Part I: Definitions and examples EIK 13, 455–463 (1977)

    Google Scholar 

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

    Google Scholar 

  11. Rozenberg, G., Salomaa, A.: The mathematical theory of L systems. New York: Academic (in press 1980)

    Google Scholar 

  12. Salomaa, A.: Formal languages. New York: Academic (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics and Computer Science, University of Leiden, Wassenaarseweg 80, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    G. Rozenberg

  2. Unit for Computer Science, McMaster University, L8S 4K1, Hamilton, Ontario, Canada

    D. Wood

Authors
  1. G. Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Wood
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Work supported partially by a Natural Sciences and Engineering Research Council of Canada grant No. A-7700 and partially by the Universitaire Instelling Antwerpen

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rozenberg, G., Wood, D. Context-free grammars with selective rewriting. Acta Informatica 13, 257–268 (1980). https://doi.org/10.1007/BF00288645

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation