Advertisement

A framework for studying grammars

  • Branislav Rovan
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)

Keywords

Complexity Class Closure Property Sentential Form Phrase Structure Grammar Context Sensitive Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Cremers, A. and Ginsburg, S., Context-free grammar forms, Journal of Computer and System Sciences 11 (1975), 86–117.Google Scholar
  3. 3.
    Gabrielian, A. and Ginsburg, S., Grammar schemata, Journal of ACM 21 (1974), 213–226.Google Scholar
  4. 4.
    Ginsburg, S., Algebraic and automata-theoretic properties of formal languages, North-Holland, Amsterdam, 1975.Google Scholar
  5. 5.
    Ginsburg, S., Methods for specifying families of formal languages — past-present-future, Invited lecture, Santa Barbara, December 1979.Google Scholar
  6. 6.
    Gladkij, A. V., Formal grammars and languages, Nauka, Moscow, 1973 (in Russian)Google Scholar
  7. 7.
    Gruska, J., Descriptional complexity (of languages), A short survey, Proceedings of MFCS 76, LNCS 45, Springer, 1976, 65–80.Google Scholar
  8. 8.
    Knuth, D. E., Big omicron and big omega and big theta, SIGACT News 8 (1976), 18–24.Google Scholar
  9. 9.
    Maurer, H. A., Salomaa, A., and Wood, D., EOL forms, Acta Informatica 8 (1977), 75–96.Google Scholar
  10. 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. 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. 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. 13.
    Rovan, B., Descriptional and derivational complexity of grammars, Research report 151, Computing Research Centre, Bratislava, 1978, 80–95, (in Slovak).Google Scholar
  14. 14.
    Rovan, B., Generative systems, Research reporet 172, Computing Research Centre, Bratislava, 1979, 48–61, (in Slovak).Google Scholar
  15. 15.
    Rovan, B., Generative systems, Research report, Komensky University, 1980, 85pp. (in Slovak).Google Scholar
  16. 16.
    Rozenberg, G., Selective substitution grammars, EIK 13(1977), 455–463.Google Scholar
  17. 17.
    Wood, D., Iterated a-NGSM maps and γ systems, Information and Control 32 (1976), 1–26.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Branislav Rovan
    • 1
  1. 1.Mathematics PavilionKomensky UniversityBratislavaCzechoslovakia

Personalised recommendations