1 Laboratoire Bordelais de Recherche en Informatique
2 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis
3 École Supérieure en Sciences Informatiques
This paper presents a new systematic approach for the uniform random generation of combinatorial objects. The method is based on the notion of object grammars which give recursive descriptions of objects and generalize context-freegrammars. The application of particular valuations to these grammars leads to enumeration and random generation of objects according to non algebraic parameters.
Keywords: q-equations,Uniform random generation,object grammars,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Bibliographic References
7 Documents citing this article
A. Denise;Y. Ponty;M. Termier, 2010, Controlled non-uniform random generation of decomposable structures, arXiv (Cornell University), 411, 40-42, pp. 3527-3552, 10.1016/j.tcs.2010.05.010, http://arxiv.org/abs/1006.0423.
P. Massazza;R. Radicioni, 2005, On computing the coefficients of bivariate holonomic formal series, Theoretical Computer Science, 346, 2-3, pp. 418-438, 10.1016/j.tcs.2005.08.011.
Alain Denise;Olivier Roques;Michel Termier, Birkhäuser Basel eBooks, Random generation of words of context-free languages according to the frequencies of letters, pp. 113-125, 2000, 10.1007/978-3-0348-8405-1_10.
Philippe Duchon, 1999, Q-grammars and wall polyominoes, Annals of Combinatorics, 3, 2-4, pp. 311-321, 10.1007/bf01608790.