Synchronization of finite automata

DOI10.4213/rm10005eOpenAlexW4381306234WikidataQ126177095 ScholiaQ126177095MaRDI QIDQ6178262

Mikhail V. Volkov

Publication date: 1 September 2023

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/rm10005

zbMATH Keywords

algorithmcomputational complexityfinite automatonsynchronizabilityČerný's conjecturereset threshold

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Complexity of computation (including implicit computational complexity) (03D15) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (1)

Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees

This page was built for publication: Synchronization of finite automata