Article ID Journal Published Year Pages File Type
438445 Theoretical Computer Science 2014 6 Pages PDF
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
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
One-sided random context grammars with a limited number of right random context rules
Authors
, ,