Skip to main content

A framework for studying grammars

  • Communications
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bucher, W., Čulík II, K., Maurer, H. A., and Wotschke, D., Concise description of finite languages, Technische Universität Graz, Bericht 32, 1979.

    Google Scholar 

  2. Cremers, A. and Ginsburg, S., Context-free grammar forms, Journal of Computer and System Sciences 11 (1975), 86–117.

    Google Scholar 

  3. Gabrielian, A. and Ginsburg, S., Grammar schemata, Journal of ACM 21 (1974), 213–226.

    Google Scholar 

  4. Ginsburg, S., Algebraic and automata-theoretic properties of formal languages, North-Holland, Amsterdam, 1975.

    Google Scholar 

  5. Ginsburg, S., Methods for specifying families of formal languages — past-present-future, Invited lecture, Santa Barbara, December 1979.

    Google Scholar 

  6. Gladkij, A. V., Formal grammars and languages, Nauka, Moscow, 1973 (in Russian)

    Google Scholar 

  7. Gruska, J., Descriptional complexity (of languages), A short survey, Proceedings of MFCS 76, LNCS 45, Springer, 1976, 65–80.

    Google Scholar 

  8. Knuth, D. E., Big omicron and big omega and big theta, SIGACT News 8 (1976), 18–24.

    Google Scholar 

  9. Maurer, H. A., Salomaa, A., and Wood, D., EOL forms, Acta Informatica 8 (1977), 75–96.

    Google Scholar 

  10. Lányiová, L., Closure properties of some families of languages defined by grammars, Master Thesis, Department of Theoretical Cybernetics, Komensky University, Bratislava, 1981, (in Slovak).

    Google Scholar 

  11. Magát, J., Inclusion and decidability properties of some families of languages defined by grammars, Master Thesis, Department of Theoretical Cybernetics, Komensky University, Bratislava, 1981, (in Slovak).

    Google Scholar 

  12. Rajlich, V., Absolutely parallel grammars and two-way finite state transducers, Journal of Computer and System Sciences 6 (1972), 324–342.

    Google Scholar 

  13. Rovan, B., Descriptional and derivational complexity of grammars, Research report 151, Computing Research Centre, Bratislava, 1978, 80–95, (in Slovak).

    Google Scholar 

  14. Rovan, B., Generative systems, Research reporet 172, Computing Research Centre, Bratislava, 1979, 48–61, (in Slovak).

    Google Scholar 

  15. Rovan, B., Generative systems, Research report, Komensky University, 1980, 85pp. (in Slovak).

    Google Scholar 

  16. Rozenberg, G., Selective substitution grammars, EIK 13(1977), 455–463.

    Google Scholar 

  17. Wood, D., Iterated a-NGSM maps and γ systems, Information and Control 32 (1976), 1–26.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rovan, B. (1981). A framework for studying grammars. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_115

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_115

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

  • Online ISBN: 978-3-540-38769-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics