Approximation algorithm for finding short synchronizing words in weighted automata
Formal Languages and Automata Theory
2021-03-31 v1 Discrete Mathematics
Data Structures and Algorithms
Combinatorics
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.
Keywords
Cite
@article{arxiv.2103.16185,
title = {Approximation algorithm for finding short synchronizing words in weighted automata},
author = {Jakub Ruszil},
journal= {arXiv preprint arXiv:2103.16185},
year = {2021}
}
Comments
9 pages, 2 figures