Approximation algorithm for finding short synchronizing words in weighted automata
Jakub Ruszil
TL;DR
This paper addresses the challenge of finding short synchronizing words in weighted automata, introducing new approximation algorithms and analyzing complexity issues.
Contribution
It presents four variations of a novel approximation algorithm for identifying short synchronizing words in weighted automata, along with complexity analysis.
Findings
New approximation algorithms for weighted automata
Analysis of complexity problems in synchronizing words
Four variations of the proposed algorithm
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · DNA and Biological Computing · Algorithms and Data Compression