this paper addresses the issue of synchronizing fuzzy finite automata, which are modelled as fuzzy graphs. The operation of such automata is intrinsically stochastic: fuzziness manifests itself in the requirement to select the subsequent state of the automation from a range of possible states that emerge during the processing of an input sequence. This research outlines a method for constructing synchronizing sequences for a fuzzy automation by converting its fuzzy graph into an equivalent crisp representation. Two optimization tasks have been formulated for selecting the best synchronizing sequences from the set of all shortest synchronizing sequences for a given fuzzy automaton, using two criteria: the length of a sequence and the proposed measure of its feasibility.
Speranskiy et al. (Fri,) studied this question.