论文信息 - Generative power of three-nonterminal scattered context grammars

Generative power of three-nonterminal scattered context grammars

This paper discusses the descriptional complexity of scattered context grammars with respect to the number of nonterminals. It proves that the three-nonterminal scattered context grammars characterize the family of recursively enumerable languages.

Alexander Meduna

[1] Alexander Meduna. Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages , 1997, Int. J. Comput. Math..

[2] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .

[3] Alexander Meduna. Automata and languages - theory and applications , 2000 .

[4] Alexander Meduna,et al. Terminating left-hand sides of scattered context productions M. Nivat , 2000, Theor. Comput. Sci..