Experimental Study of the Shortest Reset Word of Random Automata
Formal Languages and Automata Theory
2015-03-19 v1
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 states and 2 input letters with high probability is sublinear with respect to and can be estimated as
Keywords
Cite
@article{arxiv.1105.1704,
title = {Experimental Study of the Shortest Reset Word of Random Automata},
author = {Evgeny Skvortsov and Evgeny Tipikin},
journal= {arXiv preprint arXiv:1105.1704},
year = {2015}
}