3 papers
cs.FL2023
Careful Synchronization of One-Cluster Automata
Jakub Ruszil
In this paper we investigate careful synchronization of one-cluster partial automata. First we prove that in general case the shortest carefully synchronizing word for such automat…
cs.FL2021
Approximation algorithm for finding short synchronizing words in weighted automata
Jakub Ruszil
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…
cs.FL2020
On synchronization of partial automata
Jakub Ruszil
A goal of this paper is to introduce the new construction of an automaton with shortest synchronizing word of length , where and is the n…