Approximation algorithm for finding short synchronizing words in weighted automata
From MaRDI portal
Publication:6364091
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.
This page was built for publication: Approximation algorithm for finding short synchronizing words in weighted automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6364091)
