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.
翻译:在本文中,我们所处理的问题是在自动式中找到与字母$\Sigma$中的每个字母的重量相匹配的简短同步的单词。 首先我们讨论一些复杂问题,然后用四种变式提出新的近似算法。