Random generation of DFAs

Theoretical Computer Science

Volumn 330, Issue 2, 2005, Pages 221-235

  Champarnaud, Jean Marc ^a   Paranthoën, Thomas ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

Catalan families; Complete deterministic automata; m Ary trees; Random generation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; OBJECT ORIENTED PROGRAMMING; PROBABILITY; RANDOM PROCESSES; TREES (MATHEMATICS);

CATALAN FAMILIES; COMPLETE DETERMINISTIC AUTOMATA; M-ARY TREES; RANDOM GENERATION;

FINITE AUTOMATA;

EID: 11844286868     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.03.072     Document Type: Conference Paper

References (16)

1. C. Berge Théorie des graphes et ses applications 1967 Dunod Paris
2. J. Berstel, and D. Perrin Theory of Codes 1985 Academic Press New York
3. J.-M. Champarnaud, G. Hansel, T. Paranthoën, D. Ziadi, Random generation models for NFAs, J. of Automata, Lang. Combin. 9 (2) 2004.
4. M. Domaratzki, D. Kisman, and J. Shallit On the number of distinct languages accepted by finite automata with n states J. Automata Lang. Combin. 7 2002 67 78
5. W. Feller An Introduction to Probability Theory and its Application 1950 Wiley New York
6. GMP, gnu multiple precision library, www.swox.com/gmp/.
7. M.A. Harrison A census of finite automata Canad. J. Math. 17 1 1965 100 113
8. P. Hilton, and J. Pedersen Catalan numbers, their generalization, and their uses Math. Intelligencer 13 2 1991 64 75
9. D.E. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching, Addison-Wesley, Reading MA, 1973.
10. V.A. Liskovets The number of connected initial automata Kibernetika 3 5 1969 16 19
11. M. Lothaire Combinatorics on Words 1983 Addison-Wesley Reading MA
12. C. Nicaud Average state complexity of operations on unary automata M. Kutylowski L. Pacholski T. Wierzbicki Lecture Notes in Computer Science, MFCS1999 vol. 1672 1999 Springer Berlin 231 240
13. C. Nicaud, Étude du comportement en moyenne des automates finis et des langages rationnels, Ph.D. Thesis, Université Paris 7, 2000.
14. R.W. Robinson, Counting strongly connected finite automata, Graph Theory with Applications to Algorithms and Computer Science, 1985, pp. 671-685.
15. U. Tamm Lattice paths not touching a given boundary J. Statist. Plann. Inference 105 2 2002 403 448
16. S. Yu Regular languages G. Rozenberg A. Salomaa Handbook of Formal Languages 1997 Springer Berlin 41 110