A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Uniform random generation of words of rational languages
Theoretical Computer Science - Special issue: selected papers from “GASCOM '94” and the “Polyominoes and Tilings” workshops
Uniform random generation of decomposable structures using floating-point arithmetic
Theoretical Computer Science - Special issue on Caen '97
Chemins de Schröder et hiérarchies aléatoires
Theoretical Computer Science
Random Generation of Trees: Random Generators in Computer Science
Random Generation of Trees: Random Generators in Computer Science
Génération de Chemins de Dyck à pics croissants
Discrete Mathematics
Directed Column-Convex Polyominoes by Recurrence Relations
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
| Hi-index | 0.05 |
In this paper, we give a semi-algorithm to sample uniformly at random from the Fibonacci language L = ε + La + Lbb. It needs a uniform bit generator and the average complexity is linear. We show that we can transform this semi-algorithm to a true algorithm still with a linear complexity. Finally, we discuss a generalization to a class of regular languages.