Approximation algorithm for finding short synchronizing words in weighted automata

Jakub Ruszil

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment