Scattered context grammars generate any recursively enumerable language with two nonterminals

Authors:
Erzsébet Csuhaj-Varjú;György Vaszil
Affiliations:
Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende utca 13-17, 1111 Budapest, Hungary;Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende utca 13-17, 1111 Budapest, Hungary
Venue:
Information Processing Letters
Year:
2010

Citing 7
Cited 3

Formal languages

Formal languages
Generative power of three-dimensional scattered context grammars

Theoretical Computer Science
Terminating left-hand sides of scattered context productions

Theoretical Computer Science
Context-Free-Like Forms for the Phrase-Structure Grammars

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars

Journal of Automata, Languages and Combinatorics
Note: On the descriptional complexity of scattered context grammars

Theoretical Computer Science
Scattered context grammars

Journal of Computer and System Sciences

Nonterminal complexity of tree controlled grammars

Theoretical Computer Science
Language classes generated by tree controlled grammars with bounded nonterminal complexity

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Language classes generated by tree controlled grammars with bounded nonterminal complexity

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

By showing that two nonterminals are sufficient, we present the optimal lower bound on the number of nonterminals of scattered context grammars being able to generate any recursively enumerable language.