Abstract
The syntactic complexity of scattered context grammars with respect to the number of nonterminals is investigated. First, the family of the recursively enumerable languages is characterized by some basic operations, such as quotient and coding, over the languages generated by propagating scattered context grammars with four nonterminals. Then, a new method of achieving the characterization of the family of recursively enumerable languages by scattered context grammars is given; in fact, this family is characterized by scattered context grammars with only five nonterminals and a single erasing production. Finally, it is demonstrated that the number of nonterminals can be decreased by one in the present characterizations if scattered context grammars start their derivations from a word rather than a single symbol.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dassow, J., Paun, G.: Regulated rewriting in formal language theory. New York: Springer 1989
Greibach, S., Hopcroft, J.: Scattered context grammars. J. Comput. Syst. Sci.3, 233–247 (1969)
Gonczaroski, J., Warmuth, M.K.: Scattered and context-sensitive rewriting. Acta Inf.20, 391–411 (1983)
Kleijn, H.C.M., Rozenberg, G.: On the generative power of regular pattern grammars. Acta Inf.20, 391–411 (1983)
Meduna, A.: Canonical scattered rewriting. Int. J. Comput. Math.51 (in press)
Meduna, A., Sarek, M., Crooks, C.: Syntactic complexity of regulated rewriting. Kybernetika30, 177–186 (1994)
Paun, Gh.: Six nonterminals are enough for generating each R.E. language by a matrix grammar. Int. J. Comput. Math.15, 23–37 (1993)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Meduna, A. Syntactic complexity of scattered context grammars. Acta Informatica 32, 285–298 (1995). https://doi.org/10.1007/BF01178263
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01178263