Elsevier

Theoretical Computer Science

Volume 330, Issue 2, 2 February 2005, Pages 361-373
Theoretical Computer Science

On the descriptional complexity of some rewriting mechanisms regulated by context conditions

https://doi.org/10.1016/j.tcs.2004.06.032Get rights and content
Under an Elsevier user license
open archive

Abstract

We improve the upper bounds of certain descriptional complexity measures of two types of rewriting mechanisms regulated by context conditions. We prove that scattered context grammars having two context sensing productions and five nonterminals are sufficient to generate all recursively enumerable languages and we also show that the same power can be reached by simple semi-conditional grammars having 10 conditional productions with conditions of the length two or eight conditional productions with conditions of length three. The results are based on the common idea of using the so called Geffert normal forms for phrase structure grammars.

Keywords

Regulated rewriting
Descriptional complexity
Simple semi-conditional grammars
Scattered context grammars

Cited by (0)