Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2006

Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers

Abstract

We present a bijection between the set $\mathcal{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 the set $[\![ 1..(kn+1) ]\!]$ into $n$ non-empty parts. This combinatorial construction shows that the asymptotic order of the cardinality of $\mathcal{A}_n$ is related to the Stirling number $\{^{kn}_n\}$. Our bijective approach also yields an efficient random sampler of automata with $n$ states, of complexity $O(n^{3/2})$, using the framework of Boltzmann samplers.
Fichier principal
Vignette du fichier
dmAG0108.pdf (155.37 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00619870 , version 1 (03-10-2011)
hal-00619870 , version 2 (17-08-2015)

Identifiers

Cite

Frédérique Bassino, Cyril Nicaud. Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.151-160, ⟨10.46298/dmtcs.3499⟩. ⟨hal-00619870v2⟩
117 View
1080 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More