Elsevier

Theoretical Computer Science

Volume 516, 9 January 2014, Pages 127-132
Theoretical Computer Science

Note
One-sided random context grammars with a limited number of right random context rules

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

Abstract

This paper deals with regulated grammars. Specifically, it studies one-sided random context grammars. It demonstrates that any recursively enumerable language can be generated by these grammars with no more than two right random context rules.

Keywords

Formal languages
One-sided random context grammars
Right random context rules
Reduction

Cited by (0)