Synchronization of finite automata
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 77 (2022) no. 5, pp. 819-891
Voir la notice de l'article provenant de la source Math-Net.Ru
A survey of the state-of-the-art of the theory of synchronizing automata is given in its part concerned with the case of complete deterministic automata. Algorithmic and complexity-theoretic aspects are considered, the existing results related to Černý's conjecture and methods for their derivation are presented.
Bibliography: 193 titles.
Keywords:
finite automaton, synchronizability, algorithm, computational complexity, reset threshold, Černý's conjecture.
@article{RM_2022_77_5_a1,
author = {M. V. Volkov},
title = {Synchronization of finite automata},
journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
pages = {819--891},
publisher = {mathdoc},
volume = {77},
number = {5},
year = {2022},
language = {en},
url = {http://geodesic.mathdoc.fr/item/RM_2022_77_5_a1/}
}
M. V. Volkov. Synchronization of finite automata. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 77 (2022) no. 5, pp. 819-891. http://geodesic.mathdoc.fr/item/RM_2022_77_5_a1/