Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers

Abstract

We present a bijection between the set An 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 nonempty parts. This combinatorial construction shows that the asymptotic order of the cardinality of An is related to the Stirling… (More)

Topics

5 Figures and Tables

Cite this paper

@inproceedings{Bassino2008AccessibleAD, title={Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers}, author={Fr{\'e}d{\'e}rique Bassino and Cyril Nicaud}, year={2008} }