Computing a context-free grammar-generating series
Information and Computation
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Hi-index | 0.89 |