Acta Informatica

, Volume 13, Issue 3, pp 257–268 | Cite as

Context-free grammars with selective rewriting

  • G. Rozenberg
  • D. Wood


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gabrielian, A.: Pure grammars and pure languages. University of Waterloo, C. Sc. Report 2027 (1970)Google Scholar
  2. 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. 3.
    Hart, J.M.: Two extension of Kasai's universal context-free grammar. University of Kentucky, Computer Science TR 22–75, 1976Google Scholar
  4. 4.
    Herman, G.T., Rozenberg, G.: Developmental systems and languages. Amsterdam: North-Holland 1975Google Scholar
  5. 5.
    Kasai, T.: A universal context-free grammar. Information and Control 28, 30–34 (1975)Google Scholar
  6. 6.
    Liu, L.Y., Wiener, P.: An infinite hierarchy of intersections of context-free languages. Computer Science Lab. TR No. 65, Princeton (1968)Google Scholar
  7. 7.
    Maurer, H.A., Salomaa, A., Wood, D.: Pure grammars, Information and Control (in press, 1979)Google Scholar
  8. 8.
    Rozenberg, G.: A note on universal grammars. Information and Control 34, 172–175 (1977)Google Scholar
  9. 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. 10.
    Rozenberg, G., Doucet, P.: On OL languages. Information and Control 19, 302–318 (1971)Google Scholar
  11. 11.
    Rozenberg, G., Salomaa, A.: The mathematical theory of L systems. New York: Academic (in press 1980)Google Scholar
  12. 12.
    Salomaa, A.: Formal languages. New York: Academic (1973)Google Scholar

Copyright information

© Springer-Verlag 1980

Authors and Affiliations

  • G. Rozenberg
    • 1
  • D. Wood
    • 2
  1. 1.Institute of Applied Mathematics and Computer ScienceUniversity of LeidenRA LeidenThe Netherlands
  2. 2.Unit for Computer ScienceMcMaster UniversityHamiltonCanada

Personalised recommendations