Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
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
Enumeration of context-free languages and related structures
Journal of Automata, Languages and Combinatorics
Distributional learning of some context-free languages with a minimally adequate teacher
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Generating, sampling and counting subclasses of regular tree languages
Proceedings of the 14th International Conference on Database Theory
Time hierarchies for sampling distributions
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |