A variant of random context grammars: semi-conditional grammars
Theoretical Computer Science
Formal languages
A shrinking lemma for random forbidding context languages
Theoretical Computer Science
A pumping lemma for random permitting context languages
Theoretical Computer Science
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
On the descriptional complexity of some rewriting mechanisms regulated by context conditions
Theoretical Computer Science - Descriptional complexity of formal systems
Grammars with Context Conditions and Their Applications
Grammars with Context Conditions and Their Applications
Descriptional complexity of semi-conditional grammars
Information Processing Letters
Simple restriction in context-free rewriting
Journal of Computer and System Sciences
On restricted context-free grammars
Journal of Computer and System Sciences
| Hi-index | 0.00 |
This paper answers three open questions concerning the generative power of some simple variants of context-free grammars regulated by context conditions. Specifically, it discusses the generative power of so-called context-free semi-conditional grammars (which are random context grammars where permitting and forbidding sets are replaced with permitting and forbidding strings) where permitting and forbidding strings of each production are of length no more than one, and of simple semi-conditional grammars where, in addition, no production has attached both a permitting and a forbidding string. Finally, this paper also presents some normal form results, an overview of known results, and unsolved problems.