A pumping lemma for random permitting context languages
Theoretical Computer Science
A property of random context picture grammars
Theoretical Computer Science
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Left-forbidding cooperating distributed grammar systems
Theoretical Computer Science
Simple restriction in context-free rewriting
Journal of Computer and System Sciences
On the complexity of szilard languages of regulated grammars
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
On restricted context-free grammars
Journal of Computer and System Sciences
Ogden's lemma for ET0L languages
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Necessary conditions for subclasses of random context languages
Theoretical Computer Science
On the power of permitting features in cooperating context-free array grammar systems
Discrete Applied Mathematics
| Hi-index | 5.23 |