Russian Federation
Russian Federation
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.
fuzzy automata and graphs; transformations of fuzzy automata to crisp models; construction methods; synchronizing sequences for automata
1. Zadeh, L.A. Fuzzy sets / L.A. Zadeh // Information and Control. — 1965.—Vol. 8, no. 3.—Pp. 338–353.
2. Volkov, M. V. Sinhronizaciya konechnyh avtomatov / M. V. Volkov // Uspehi matematicheskih nauk.—2022.—T. 77, № 5 (467).—S. 53–130.
3. Kofman, A. Vvedenie v teoriyu nechetkih mnozhestv / A. Kofman.—M. : Radio i svyaz'.—1982.— 432 s.
4. Ventcel', E. S. Teoriya veroyatnostey i ee inzhenernye prilozheniya / E. S. Ventcel', L. A. Ovcharov. — M. : Nauka, 1988. — 480 s. — (Fizikomatematicheskaya biblioteka inzhenera). — EDN TBVRFB.
5. Speranskiy, D. V. Poisk sostyazaniy signalov v nechetkih asinhronnyh avtomatah / D. V. Speranskiy, S.A. Lunev // Avtomatika na transporte. — 2024. — T. 10, № 2. — S. 178–189. — DOIhttps://doi.org/10.20295/2412-9186-2024-10-02-178-189. — EDN JANKXY.
6. Speranskiy, D.V. Postroenie mnozhestv prostyh putey mezhdu dvumya uzlami v nechetkih transportnyh setyah / D. V. Speranskiy, S.A. Lunev // Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitel'naya tehnika i informatika. — 2025. — № 70. — S. 81–90. — DOI:https://doi.org/10.17223/19988605/70/8.—EDN XDTQXD.
7. Speranskiy, D.V. Postroenie obnaruzhivayuschih testov dlya nechetkih avtomatov / D.V. Speranskiy, S.A. Lunev // Avtomatika na transporte.—2025.— T. 11, № 1.—S. 66–74.—DOI:https://doi.org/10.20295/2412–9186– 2025–11–01–66–74.—EDN RXKGUI.
8. Mur, E.F. Umozritel'nye eksperimenty s posledovatel'nostnymi mashinami / E.F. Mur // Avtomaty: sb. st.—M., 1956.—S. 179–210.
9. Gill, A. Vvedenie v teoriyu konechnyh / A. Gill.— M.: Nauka, Glavnaya redakciya fiz.-mat. literatury, 1966.—272 s.
10. Speranskiy, D. V. Lekcii po teorii eksperimentov s konechnymi avtomatami / D. V. Speranskiy. — M.: BINOM. Laboratoriya znaniy,2010.— 287 s.
11. Rabin, M. O. Finite Automata and Their Decision Problems / M.O. Rabin, D. Scott // IBM J. Res. Develop. — 1959. — Vol. 3, no. 2.—Pp. 114–125.
12. Kormen, T. Algoritmy: postroenie i analiz / T. Kormen, Ch. Leyzerson, R. Rivest, K. Shtayn. — 3-e izd. — M. : Vil'yams, 2011.—1324 s.
13. Lui, C. L. Some Memory Aspects of Finite Automata / C. L. Lui // M.I.T.Rcs. Lab. Electron. Tech. Rept. — 1963. — Vol. 411.
