Skip to main content

Some recent restrictions in the derivation of context-free 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abraham, Some questions of phrase-structure grammars, Comput. Lingv., 4 (1965), 61–70.

    Google Scholar 

  2. A.B. Cremers, O. Mayer, On matrix languages, Inform. Control, 23 (1973), 86–96.

    Google Scholar 

  3. A.B. Cremers, O. Mayer, On vector languages, Proc. Symp. Summer School Math. Found. Comp. Sci., High Tatras, 1973.

    Google Scholar 

  4. J. Dassow, Gh. PĂun, The regulated rewriting in formal language theory, Akademie Verlag, Berlin (in press).

    Google Scholar 

  5. I. Friš, Grammars with partial ordering of rules, Inform. Control, 12 (1968), 415–425.

    Google Scholar 

  6. M. Gheorghe, Linear valence grammars, Proc. 4th Intern. Meeting Young Comp. Sci., Smolenice, 1986.

    Google Scholar 

  7. M. Gheorghe, Gh. PĂun, Two (infinite ?) hierarchies of vector languages, Bull. of the EATCS, 29 (1986), 27–32.

    Google Scholar 

  8. O.H. Ibarra, S.K. Sahni, C.E. Kim, Finite automata with multiplication, Th. Comp. Sci., 2 (1976), 271–294.

    Google Scholar 

  9. J. Kelemen, Conditional grammars. Motivations, definition and some properties, Proc. Conf. Aut. Lang. Math. Syst., Salgotarjan, 1984.

    Google Scholar 

  10. J. Kleijn, Selective substitution grammars based on context-free productions, Doctoral Dissertation, Univ. of Leiden, 1983.

    Google Scholar 

  11. M. Marcus, Gh. PĂun, Valence gsm mappings, Bull. Math. Soc. Sci. Math. R.S. Roumanie (in press).

    Google Scholar 

  12. Gh. PĂun, On the generative capacity of conditional grammars, Inform. Control, 43 (1979), 178–186.

    Google Scholar 

  13. Gh. PĂun, A new generative device: valence grammars, Rev. Roum. Math. Pures Appl., 25 (1980), 911–924.

    Google Scholar 

  14. Gh. PĂun, A variant of random context grammars: semi-conditional grammars, Th. Comp. Sci., 41 (1985), 1–17.

    Google Scholar 

  15. D. Rozenkrantz, Programmed grammars and classes of formal languages, Journal of the ACM, 16 (1969), 107–131.

    Google Scholar 

  16. A. Salomaa, On some families of formal languages obtained by regulated derivations, Ann. Acad. Sci. Fenn., Ser. Al, 1970, 479.

    Google Scholar 

  17. A. Salomaa, Formal languages, Academic Press, New York, London,1973.

    Google Scholar 

  18. A.P.J. Van der Walt, Random context languages, Symp. on Formal Languages at the MFI Oberwolfach, 1970, North-Holland, 1972, 66–68.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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

PĂun, G. (1987). Some recent restrictions in the derivation of context-free 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_33

Download citation

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

  • 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