A linear algorithm for the random sampling from regular languages

Algorithmica (New York)

Volumn 62, Issue 1-2, 2012, Pages 130-145

  Bernardi, Olivier ^a   Giménez, Omer ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Random sampling; Regular languages

Indexed keywords

DIVIDE AND CONQUER; LINEAR ALGORITHMS; RANDOM SAMPLING; RECURSIVE METHODS;

CONTEXT FREE LANGUAGES; DIGITAL ARITHMETIC; FORMAL LANGUAGES; OPTIMIZATION;

ALGORITHMS;

EID: 84855347309     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-010-9446-5     Document Type: Article

References (17)

1. Alonso, L., Schott, R.: Random Generation of Trees: Random Generators in Computer Science. Kluwer Academic, Norwell (1995)
2. E. Barcucci A. Del Lungo E. Pergola 1999 Random generation of trees and other combinatorial objects Theor. Comp. Sci. 218 219 232 (Pubitemid 129609110)
3. E. Barcucci A. Del Lungo E. Pergola R. Pinzani 1999 ECO: a general methodology for the enumeration of combinatorial objects J. Differ. Equ. Appl. 5 435 490
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 1st edn. MIT Press, Cambridge (1990)
5. A. Denise 1996 Génération aléatoire uniforme de mots de langages rationnels Theor. Comp. Sci. 159 1 43 63 (Pubitemid 126412804)
6. Denise, A., Rocques, O., Termier, M.: Random generation of words of context-free languages according to the frequencies of letters. In: Colloquium on Mathematics and Computer Science, pp. 113-125 (2000)
7. A. Denise P. Zimmermann 1999 Uniform random generation of decomposable structures using floating-point arithmetic Theor. Comp. Sci. 218 2 233 248 (Pubitemid 129609111)
8. P. Duchon P. Flajolet G. Louchard G. Schaeffer 2004 Boltzmann samplers for the random generation of combinatorial structures Comb. Probab. Comput. 3 4-5 577 625
9. P. Flajolet P. Zimmermann B. Van Cutsem 1994 A calculus for the random generation of labelled combinatorial structures Theor. Comp. Sci. 132 1 1 35
10. E. Fusy 2009 Uniform random sampling of planar graphs in linear time Random Struct. Algorithms 35 4 464 522
11. M. Goldwurm 1995 Random generation of words in an algebraic language in linear binary space Inf. Process. Lett. 54 4 229 233
12. T. Hickey J. Cohen 1983 Uniform random generation of strings in a context-free language SIAM J. Comput. 12 4 645 655
13. Kannan, S., Sweedyk, Z., Mahaney, S.: Counting and random generation of strings in regular languages. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 551-557 (1995)
14. Knuth, D.: The Art of Computer Programming. Seminumerical Algorithms, vol. 2. Addison-Wesley, Reading (1969)
15. H.G. Mairson 1994 Generating words in a context free language uniformly at random Inf. Process. Lett. 49 2 95 99 (Pubitemid 124013102)
16. M. Matsumoto T. Nishimura 1998 Mersenne twister: a 623-dimensionally equidistributed uniform pseudorandom number generator ACM Trans. Model. Comput. Simul. 8 1 3 30
17. Nijenhuis, A., Wilf, H.S.: Combinatorial Algorithms. Academic Press, San Diego (1978)