Enumeration and random generation of accessible automata
Authors:
- Frédérique BassinoFBFrédérique Bassino
- Cyril NicaudCNCyril Nicaud
- 1 August 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 381 (1-3) , 86-104
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Random generation of DFAsTheoretical Computer Science, 2005
- Boltzmann Samplers for the Random Generation of Combinatorial StructuresCombinatorics, Probability and Computing, 2004
- Uniform random generation of decomposable structures using floating-point arithmeticTheoretical Computer Science, 1999
- On the LambertW functionAdvances in Computational Mathematics, 1996
- A calculus for the random generation of labelled combinatorial structuresTheoretical Computer Science, 1994
- The state complexities of some basic operations on regular languagesTheoretical Computer Science, 1994
- Enumeration of strongly connected sequential machinesInformation and Control, 1965
- A Census of Finite AutomataCanadian Journal of Mathematics, 1965
- An Asymptotic Formula for the Differences of the Powers at ZeroThe Annals of Mathematical Statistics, 1961