Abstract
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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Skvortsov, E., & Tipikin, E. (2011). Experimental study of the shortest reset word of random automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6807 LNCS, pp. 290–298). https://doi.org/10.1007/978-3-642-22256-6_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
