Formal languages
Petri net algorithms in the theory of matrix grammars
Acta Informatica
Grammars with controlled derivations
Handbook of formal languages, vol. 2
A pumping lemma for random permitting context languages
Theoretical Computer Science
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems
Language and Automata Theory and Applications
Erasing in Petri Net Languages and Matrix Grammars
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Workspace theorems for regular-controlled grammars
Theoretical Computer Science
A sufficient condition for erasing productions to be avoidable
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On restricted context-free grammars
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Three open questions in the theory of regulated rewriting are addressed. The first is whether every permitting random context grammar has a non-erasing equivalent. The second asks whether the same is true for matrix grammars without appearance checking. The third concerns whether permitting random context grammars have the same generative capacity as matrix grammars without appearance checking. The main result is a positive answer to the first question. For the other two, conjectures are presented. It is then deduced from the main result that at least one of the two holds.