Approximation algorithm for finding short synchronizing words in weighted automata
arXiv:2103.16185
Abstract
In this paper we are dealing with the issue of finding possibly short synchronizing words in automata with weight assigned to each letter in the alphabet . First we discuss some complexity problems, and then we present new approximation algorithm in four variations.
9 pages, 2 figures