On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages. Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.
Clique polynomials have a unique root of smallest modulus.
Random Generation of Words in an Algebraic Language in Linear Binary Space. Rational Transductions and Complexity of Counting Problems. Ranking and Formal Power Series. The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages. Computing the Counting Function of Context-Free Languages.