Skip to main content
SpringerLink
Log in

Basic ideas of selective substitution grammars

  • Chapter 2 Theory Of Formal Grammars
  • Conference paper
  • First Online:
Trends, Techniques, and Problems in Theoretical Computer Science (IMYCS 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 281))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aalbersberg, IJ.J. and G. Rozenberg, CTS systems and Petri nets, Theoretical Computer Science 40 (1985), 149–162.

    Google Scholar 

  2. Dahlhaus, E. and H. Gaifman, Concerning two-adjacent context-free languages, Theoretical Computer Science 41 (1985), 169–184.

    Google Scholar 

  3. Dassow, J. and Gh. PĂun, Regulated rewriting in formal language theory, in preparation.

    Google Scholar 

  4. Ehrenfeucht, A., Hoogeboom, H.J., and G. Rozenberg, Real-time coordinated pair systems, Dept. of Comp. Sci., Univ. of Colorado at Boulder, Tech. Rep. CU-CS-259-83, 1983.

    Google Scholar 

  5. Ehrenfeucht, A., Hoogeboom, H.J., and G. Rozenberg, On the active and full records of the use of memory in right-boundary grammars and push-down automata, Theoretical Computer Science 48 (1987) 201–228.

    Google Scholar 

  6. Ehrenfeucht, A., Hoogeboom, H.J., and G. Rozenberg, On coordinated rewriting, Lect. Notes in Comp. Sci. 199 (1985), 100–111.

    Google Scholar 

  7. Ehrenfeucht, A., Hoogeboom, H.J., and G. Rozenberg, Computations in coordinated pair systems, Fundamentae Informaticae IX (1986), 455–480.

    Google Scholar 

  8. Ehrenfeucht, A., Hoogeboom, H.J., and G. Rozenberg, Coordinated pair systems. Part I: Dyck words and classical pumping, R.A.I.R.O. Informatique Theorique 20 (1986), 405–424.

    Google Scholar 

  9. Ehrenfeucht, A., Hoogeboom, H.J., and G. Rozenberg, Coordinated pair systems. Part II: Sparse structure of Dyck words and Ogden's lemma, R.A.I.R.O. Informatique Theorique 20 (1986), 425–439.

    Google Scholar 

  10. Ehrenfeucht, A., Kleijn, H.C.M., and G. Rozenberg, Adding global forbidding context to context-free grammars, Theoretical Computer Science 37 (1985), 337–360.

    Google Scholar 

  11. Ehrenfeucht, A., Maurer, H., and G. Rozenberg, Continuous grammars, Information and Control 46 (1980), 71–91.

    Google Scholar 

  12. Gonczarowski, J., Kleijn, H.C.M., and G. Rozenberg, Closure properties of selective substitution grammars. Part I, International Journal of Computer Mathematics 14 (1983), 19–42.

    Google Scholar 

  13. Gonczarowski, J., Kleijn, H.C.M., and G. Rozenberg, Closure properties of selective substitution grammars. Part II, International Journal of Computer Mathematics 14 (1983), 109–134.

    Google Scholar 

  14. Gonczarowski, J., Kleijn, H.C.M., and G. Rozenberg, Grammatical constructions in selective substitution grammars, Acta Cybernetica 6 (1983), 239–269.

    Google Scholar 

  15. Gonczarowski, J. and E. Shamir, Pattern selector grammars and several parsing algorithms in the context-free style, Journal of Computer and Systems Sciences 30 (1985), 249–273.

    Google Scholar 

  16. Gonczarowski, J. and M.K. Warmuth, Applications of scheduling theory to formal language theory, Theoretical Computer Science 37 (1985), 217–243.

    Google Scholar 

  17. Kleijn, H.C.M., Selective substitution grammars based on context-free productions, Ph.D. Thesis, University of Leiden, 1983.

    Google Scholar 

  18. Kleijn, H.C.M., and G. Rozenberg, Problems P 111–113, EATCS Bulletin 26 (1985), 240–241.

    Google Scholar 

  19. Kleijn, H.C.M. and G. Rozenberg, Context-free like restrictions on selective rewriting, Theoretical Computer Science 16 (1981), 237–269.

    Google Scholar 

  20. Kleijn, H.C.M. and G. Rozenberg, Sequential, continuous and parallel grammars, Information and Control 48 (1981), 221–260. Corrigendum, ibidem 52 (1982), 364.

    Google Scholar 

  21. Kleijn, H.C.M. and G. Rozenberg, Multi grammars, International Journal of Computer Mathematics 12 (1983), 177–201.

    Google Scholar 

  22. Kleijn, H.C.M. and G. Rozenberg, On the generative power of regular pattern grammars, Acta Informatica 20 (1983), 391–411.

    Google Scholar 

  23. Rozenberg, G., Selective substitution grammars (Towards a framework for rewriting systems). Part I: Definitions and examples, Elektronische Informationsverarbeitung und Kybernetik 13 (1977), 455–463.

    Google Scholar 

  24. Rozenberg, G., On coordinated selective substitutions: towards a unified theory of grammars and machines, Theoretical Computer Science 37 (1985), 31–50.

    Google Scholar 

  25. Rozenberg, G. and A. Salomaa, The mathematical theory of L systems, Academic Press, New York, 1980.

    Google Scholar 

  26. Rozenberg, G. and D. Wood, Context-free grammars with selective rewriting, Acta Informatica 13 (1980), 257–268.

    Google Scholar 

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

    Google Scholar 

  28. Siromoney, R. and V.R. Dare, On infinite words obtained by selective substitution grammars, Theoretical Computer Science 39 (1985), 281–295.

    Google Scholar 

  29. Siromoney, R. and K.G. Subramanian, Selective substitution array grammars, Information Sciences 25 (1981), 73–83.

    Google Scholar 

  30. Subramanian, K.G., On the language class of continuous grammars, unpublished manuscript (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Leiden, P.O. Box 9512, 2300 RA, Leiden, The Netherlands

    H. C. M. Kleijn

Authors
  1. H. C. M. Kleijn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alica Kelemenová Jozef Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kleijn, H.C.M. (1987). Basic ideas of selective substitution grammars. In: Kelemenová, A., Kelemen, J. (eds) Trends, Techniques, and Problems in Theoretical Computer Science. IMYCS 1986. Lecture Notes in Computer Science, vol 281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540185356_32

Download citation

  • DOI: https://doi.org/10.1007/3540185356_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18535-2

  • Online ISBN: 978-3-540-48008-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation