@dblp

On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.

, , and . STACS, volume 2010 of Lecture Notes in Computer Science, page 305-316. Springer, (2001)

Links and resources

Tags