Reset sequences for monotonic automata
SIAM Journal on Computing
SAT Local Search Algorithms: Worst-Case Study
Journal of Automated Reasoning
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Synchronizing automata with a letter of deficiency 2
Theoretical Computer Science
Genetic Algorithm for Synchronization
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
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
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
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
Generating small automata and the Černý conjecture
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
In this paper we describe an approach to finding the shortest reset word of a finite synchronizing automaton by using a SAT solver. We use this approach to perform an experimental study of the length of the shortest reset word of a finite synchronizing automaton. The largest automata we considered had 100 states. The results of the experiments allow us to formulate a hypothesis that the length of the shortest reset word of a random finite automaton with n states and 2 input letters with high probability is sublinear with respect to n and can be estimated as 1.95n0.55.