Synchronization of finite automata

Volkov, M. V.

doi:10.4213/rm10005e

Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/132393

Title:	Synchronization of finite automata
Authors:	Volkov, M. V.
Issue Date:	2022
Publisher:	Steklov Mathematical Institute of Russian Academy of Sciences
Citation:	Volkov, MV 2022, 'Synchronization of finite automata', Russian Mathematical Surveys, Том. 77, № 5, стр. 819-891. https://doi.org/10.4213/rm10005e Volkov, M. V. (2022). Synchronization of finite automata. Russian Mathematical Surveys, 77(5), 819-891. https://doi.org/10.4213/rm10005e
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. © 2022 Russian Academy of Sciences, Steklov Mathematical Institute of RAS.
Keywords:	ALGORITHM COMPUTATIONACOMPLEXITY FINITE AUTOMATON RESET THRESHOLD SYNCHRONIZABILITY ČERNÝ’S CONJECTURE
URI:	http://elar.urfu.ru/handle/10995/132393
Access:	info:eu-repo/semantics/openAccess
RSCI ID:	59257573
SCOPUS ID:	85165308000
WOS ID:	000992306600002
PURE ID:	a1ae824c-d559-4445-895a-ca594b1ce589 40039701
ISSN:	0036-0279
DOI:	10.4213/rm10005e
Sponsorship:	Russian Foundation for Basic Research, РФФИ, (19-11-50120) Ministry of Education and Science of the Russian Federation, Minobrnauka, (FEUZ-2020-0016) This research was supported by the Russian Foundation for Basic Research under grant no. 19-11-50120 and by the Ministry of Science and Higher Education of the Russian Federation (project no. FEUZ-2020-0016).
Appears in Collections:	Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:

File	Description	Size	Format
2-s2.0-85165308000.pdf		1,55 MB	Adobe PDF	View/Open

Show full item record