Simulating finite automata with context-free grammars
Information Processing Letters
Theoretical Computer Science
A linearly computable measure of string complexity
Theoretical Computer Science
Applying tree languages in proof theory
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Hi-index | 0.00 |