RUS  ENG
Full version
JOURNALS // Uspekhi Matematicheskikh Nauk // Archive

Uspekhi Mat. Nauk, 2022 Volume 77, Issue 5(467), Pages 53–130 (Mi rm10005)

This article is cited in 2 papers

Synchronization of finite automata

M. V. Volkov

Ural Federal University

Abstract: 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.

UDC: 519.713

MSC: Primary 03D15, 20F10; Secondary 20M35, 68Q25, 68Q45, 68Q70, 68R15

Received: 31.08.2020

DOI: 10.4213/rm10005


 English version:
Russian Mathematical Surveys, 2022, 77:5, 819–891

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025