Summary
In this paper, we mainly study the relation between scattered context grammars, which are an example for regulated context-free rewriting devices, and context-sensitive grammars. Emphasis is laid upon both normal form characterizations of context-sensitive grammars and an argument in how far scattered context grammars are stronger, with respect to generative capacity than unordered scattered context grammars.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ábrahám, S.: Some questions of phrase structure grammars. Computational Linguistics 4, 61–70 (1965)
Book, R. V.: On the structure of context-sensitive grammars. Center for Res. in Comp. Tech., Harvard University, Cambridge (Mass.), TR 6-71, 1971
Cremers, A. B., Mayer, O.: On matrix languages. Information and Control 23, 86–96 (1973)
Cremers, A. B., Mayer, O.: On vector languages. J. Computer and System Sciences, to appear, 1973
Cremers, A. B., Maurer, H. A., Mayer, O.: A note on leftmost restricted random context grammars. Information Processing Letters 2, 31–33 (1973)
Ginsburg, S.: The mathematical theory of context-free languages. New York: McGraw-Hill 1966
Ginsburg, S., Spanier, E. H.: Control sets on grammars. Math. Systems Theory 2, 159–177 (1968)
Greibach, S. A., Hopcroft, J. E.: Scattered context grammars. J. Computer and System Sciences 3, 233–247 (1969)
Hopcroft, J. E., Ullman, J. D.: Formal languages and their relation to automata. Reading (Mass.): Addison-Wesley 1969
Kasai, T.: An hierarchy between context-free and context-sensitive languages. J. Computer and System Sciences 4, 492–508 (1970)
Kuroda, S.-Y.: Classes of languages and linear-bounded automata. Information and Control 7, 207–223 (1964)
Levitina, M. K.: On some grammars with global productions. (In Russian) Akad. Nauk SSSR Nauchno-Tekhn. Inform. Ser. 2, 32–36 (1972)
Lomkovskaya, M. V.: On some properties of k-conditional grammars. (In Russian) Akad. Nauk SSSR Nauchno-Tekhn. Inform. Ser. 2, 61–21 (1972)
Maurer, H. A.: Simple matrix languages with a leftmost restriction. Information and Control, to appear, 1973
Mayer, O.: Some restrictive devices for context-free grammars. Information and Control 20, 69–92 (1972)
Milgram, D. L., Rosenfeld, A.: A note on scattered context grammars. Information Processing Letters 1, 47–50 (1971)
Rozenberg, G.: Direction controlled programmed grammars. Acta Informatica 1, 242–252 (1972)
Rosenkrantz, D. J.: Programmed grammars and classes of formal languages. J. ACM 16, 107–131 (1969)
Salomaa, A.: Periodically time-variant context-free grammars. Information and Control 17, 294–311 (1970)
Salomaa, A.: Matrix grammars with a leftmost restriction. Information and Control 20, 143–149 (1972)
Salomaa, A.: Formal languages. New York: Academic Press 1973
Stotskij, E. D.: On grammars with rules of a special form. (In Russian) Akad. Nauk SSSR Nauchno-Tekhn. Inform. Ser. 2, 34–37 (1971)
Stotskij, E. D.: Remarks on the paper by M. K. Levitina. (In Russian) Akad. Nauk SSSR Nauchno-Tekhn. Inform. Ser. 2, 37 (1972)
Van der Walt, A. P. J.: Random context languages. Symp. on Formal Languages, Oberwolfach, Germany 1970
Author information
Authors and Affiliations
Additional information
Parts of this paper have been presented at the Conference on “Formal Languages and Programming Languages”, University of Dortmund, Germany, March 29–31, 1973.
Rights and permissions
About this article
Cite this article
Cremers, A.B. Normal forms for context-sensitive grammars. Acta Informatica 3, 59–73 (1973). https://doi.org/10.1007/BF00288653
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288653