Skip to Main content Skip to Navigation
Journal articles

Enumeration and random generation of accessible automata

Abstract : We present a bijection between the set A_n of deterministic and accessible automata with n states on a k-letters alphabet and some diagrams, which can themselves be represented as partitions of a set of kn+1 elements into n non-empty subsets. This combinatorial construction shows that the asymptotic order of the cardinality of A_n is related to Stirling numbers of the second kind . Our bijective approach also yields an efficient random sampler of automata with n states for the uniform distribution: its complexity is O(n^{3/2}), using the framework of Boltzmann samplers.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Frédérique Bassino Connect in order to contact the contributor
Submitted on : Wednesday, February 24, 2010 - 5:48:40 PM
Last modification on : Tuesday, January 18, 2022 - 10:14:02 AM
Long-term archiving on: : Friday, June 18, 2010 - 7:38:09 PM


Files produced by the author(s)


  • HAL Id : hal-00459712, version 1


Frédérique Bassino, Cyril Nicaud. Enumeration and random generation of accessible automata. Theoretical Computer Science, Elsevier, 2007, 381, pp.86-104. ⟨hal-00459712⟩



Les métriques sont temporairement indisponibles