Approximation algorithm for finding short synchronizing words in weighted automata

03/30/2021
by   Jakub Ruszil, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro