Approximation algorithm for finding short synchronizing words in weighted automata

MaRDI QIDQ6364091zbMATH OpenFDO

Authors Jakub Ruszil

Publication date 30 March 2021

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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 $Sigma$. 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)