On the number of non-isomorphic strongly connected finite automata
Journal of Information Processing and Cybernetics
Counting strongly connected finite automata
Graph theory with applications to algorithms and computer science
The state complexities of some basic operations on regular languages
Theoretical Computer Science
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Uniform random generation of decomposable structures using floating-point arithmetic
Theoretical Computer Science - Special issue on Caen '97
Combinatorial Algorithms: For Computers and Hard Calculators
Combinatorial Algorithms: For Computers and Hard Calculators
On the number of distinct languages accepted by finite automata with n states
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Theoretical Computer Science - Descriptional complexity of formal systems
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Elements of Automata Theory
Enumeration and generation with a string automata representation
Theoretical Computer Science
On the average state and transition complexity of finite languages
Theoretical Computer Science
Random Generation of Deterministic Tree (Walking) Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
On the Use of Uniform Random Generation of Automata for Testing
Electronic Notes in Theoretical Computer Science (ENTCS)
REGAL: a library to randomly and exhaustively generate automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Parametric random generation of deterministic tree automata
Theoretical Computer Science
The average complexity of Moore's state minimization algorithm is O(n log log n)
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Generating, sampling and counting subclasses of regular tree languages
Proceedings of the 14th International Conference on Database Theory
Random generation of deterministic acyclic automata using Markov chains
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Average complexity of Moore's and Hopcroft's algorithms
Theoretical Computer Science
Sampling different kinds of acyclic automata using Markov chains
Theoretical Computer Science
The number of DFAs for a given spanning tree
The Journal of Supercomputing
| Hi-index | 5.23 |
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 the Stirling number {knn}. Our bijective approach also yields an efficient random sampler, for the uniform distribution, of automata with n states, its complexity is O(n^3^/^2), using the framework of Boltzmann samplers.