  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 $\Sigma$. First we discuss some complexity problems, and then we
present new approximation algorithm in four variations.
