Generative power of three-dimensional scattered context grammars
Theoretical Computer Science
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Context-Free-Like Forms for the Phrase-Structure Grammars
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Nonterminal complexity of programmed grammars
Theoretical Computer Science
On the degree of scattered context-sensitivity
Theoretical Computer Science
Information Processing Letters
On the descriptional complexity of some rewriting mechanisms regulated by context conditions
Theoretical Computer Science - Descriptional complexity of formal systems
Descriptional complexity of multi-parallel grammars
Information Processing Letters
Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
Journal of Automata, Languages and Combinatorics
Scattered context grammars generate any recursively enumerable language with two nonterminals
Information Processing Letters
Nonterminal complexity of tree controlled grammars
Theoretical Computer Science
Hi-index | 5.23 |
A tree controlled grammar is specified as a pair (G,G^') where G is a context-free grammar and G^' is a regular grammar. Its language consists of all terminal words with a derivation in G such that all levels of the corresponding derivation tree-except the last level-belong to L(G^'). We define the nonterminal complexity V ar(H) of H=(G,G^') as the sum of the numbers of nonterminals of G and G^'. In Turaev et al. (2011) [23] it is shown that tree controlled grammars H with V ar(H)@?9 are sufficient to generate all recursively enumerable languages. In this paper, we improve the bound to seven. Moreover, we show that all linear and regular simple matrix languages can be generated by tree controlled grammars with a nonterminal complexity bounded by three, and we prove that this bound is optimal for the mentioned language families. Furthermore, we show that any context-free language can be generated by a tree controlled grammar (G,G^') where the number of nonterminals of G and G^' is at most four.