Generating small automata and the Černý conjecture

Authors:
Andrzej Kisielewicz;Marek Szykuła
Affiliations:
Department of Mathematics and Computer Science, University of Wrocław, Poland;Department of Mathematics and Computer Science, University of Wrocław, Poland
Venue:
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Year:
2013

Citing 12
Cited 0

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
Reset sequences for monotonic automata

SIAM Journal on Computing
Synchronizing Automata and the Černý Conjecture

Language and Automata Theory and Applications
Exact enumeration of acyclic deterministic automata

Discrete Applied Mathematics
Slowly synchronizing automata and digraphs

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The complexity of finding reset words in finite automata

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Experimental study of the shortest reset word of random automat

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Modifying the upper bound on the length of minimal synchronizing word

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Approximating the minimum length of synchronizing words is hard

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Effective synchronizing algorithms

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new efficient algorithm to generate all nonisomorphic automata with given numbers of states and input letters. The generation procedure may be restricted effectively to strongly connected automata. This is used to verify the Černý conjecture for all binary automata with n≤11 states, which improves the results in the literature. We compute also the distributions of the length of the shortest reset word for binary automata with n≤10 states, which completes the results reported by other authors.