Skip to main content

Some Aspects of Random Context Grammars

  • Conference paper
GI — 6. Jahrestagung

Part of the book series: Informatik — Fachberichte ((INFORMATIK,volume 5))

Abstract

Two generalizations of the notion of a random context grammar are considered. The first one equips a random context grammar with a possibility of a (limited) counting of a number of occurrences of the symbol to be rewritten. The second one applies productions in parallel (as in L systems). It is proved that these two generalizations do not increase the language generating power of the class of random context grammars. Also some normal form theorems are proved.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Lindenmayer, 1975, Developmental systems and languages in their biological context, contribution to G.T. Herman and G.Rozenberg, Developmental systems and languages, North-Holland Publ. Comp., Amsterdam

    Google Scholar 

  2. A.N. Maslov and E.D. Stocki, 1975, On some classes of formal grammars (in Russian), Probability theory. Mathematical statistics. Theoretical cybernetics. v. 12, 155–187.

    Google Scholar 

  3. O. Mayer, 1972, Some restrictive devices for context free grammars, Information and Control, v. 20, 69–92.

    Article  MathSciNet  MATH  Google Scholar 

  4. M. Penttonen, 1975, ETOL grammars and N grammars, Information Processing Letters, v. 4, 11–13.

    Article  MathSciNet  MATH  Google Scholar 

  5. G. Rozenberg, 1975, More on a connection between ETOL systems and random context grammars, Dept. of Mathematics, University of Antwerp, Technical report No.75/15.

    Google Scholar 

  6. A. Salomaa, 1973, Formal languages, Academic Press, New York.

    MATH  Google Scholar 

  7. A. Salomaa, 1974, Parallelism in rewriting systems, Lecture Notes in Computer Science, v. 14,

    Google Scholar 

  8. Van der Walt, 1971, Random context languages, Proceedings of the IFIP-Congress 1971, 66–68.

    Google Scholar 

  9. Von Solms, 1975, On TOL languages over terminals, Information Processing Letters, v. 3, 69–70.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Rozenberg, G., von Solms, S.H. (1976). Some Aspects of Random Context Grammars. In: Neuhold, E.J. (eds) GI — 6. Jahrestagung. Informatik — Fachberichte, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95289-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-95289-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07912-5

  • Online ISBN: 978-3-642-95289-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics