Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement
نویسندگان
چکیده
Recently, it has been shown that every recursively enumerable language can be generated by a scattered context grammar with no more than three nonterminals. However, in that construction, the maximal number of nonterminals simultaneously rewritten during a derivation step depends on many factors, such as the cardinality of the alphabet of the generated language and the structure of the generated language itself. This paper improves the result by showing that the maximal number of nonterminals simultaneously rewritten during any derivation step can be limited by a small constant regardless of other factors.
منابع مشابه
On Descriptional Complexity of Partially Parallel Grammars
This paper presents some new results concerning the descriptional complexity of partially parallel grammars. Specifically, it proves that every recursively enumerable language is generated (i) by a four-nonterminal scattered context grammar with no more than four non-context-free productions, (ii) by a two-nonterminal multisequential grammar with no more than two selectors, or (iii) by a three-...
متن کاملGenerating all permutations by context-free grammars in Greibach normal form
We consider context-free grammars Gn in Greibach normal form and, particularly, in Greibach m-form (m = 1, 2) which generates the finite language Ln of all n! strings that are permutations of n different symbols (n ≥ 1). These grammars are investigated with respect to their descriptional complexity, i.e., we determine the number of nonterminal symbols and the number of production rules of Gn as...
متن کاملOn the descriptional complexity of scattered context grammars
This paper proves that every recursively enumerable language is generated by a scattered context grammar with no more than four nonterminals and three non-context-free productions. In its conclusion, it gives an overview of the results and open problems concerning scattered context grammars and languages.
متن کاملConciseness of Associative Language Descriptions
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languages. ALD do not use nonterminal symbols, but rely on permissible contexts for specifying valid syntax trees. In order to assess ALD adequacy, we analyze the descriptional complexity of structurally equivalent CF and ALD...
متن کاملGenerating all permutations by context-free grammars in Chomsky normal form
Let Ln be the finite language of all n! strings that are permutations of n different symbols (n ≥ 1). We consider context-free grammars Gn in Chomsky normal form that generate Ln. In particular we study a few families {Gn}n≥1, satisfying L(Gn) = Ln for n ≥ 1, with respect to their descriptional complexity, i.e. we determine the number of nonterminal symbols and the number of production rules of...
متن کامل