|
Zapiski Nauchnykh Seminarov POMI, 2012, Volume 402, Pages 9–39
(Mi znsl5235)
|
|
|
|
This article is cited in 33 scientific papers (total in 33 papers)
Primitive digraphs with large exponents and slowly synchronizing automata
D. S. Ananichev, M. V. Volkov, V. V. Gusev Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russia
Abstract:
We exhibit several infinite series of synchronizing automata. The minimum length of reset words for each of the automata is close to the state number squared. All these automata are tightly related to primitive directed graphs with large exponents.
Key words and phrases:
primitive digraph, exponent of a digraph, synchronizing automaton, reset word, synchronization threshold, coloring of a digraph.
Received: 27.12.2011
Citation:
D. S. Ananichev, M. V. Volkov, V. V. Gusev, “Primitive digraphs with large exponents and slowly synchronizing automata”, Combinatorics and graph theory. Part IV, RuFiDiM'11, Zap. Nauchn. Sem. POMI, 402, POMI, St. Petersburg, 2012, 9–39; J. Math. Sci. (N. Y.), 192:3 (2013), 263–278
Linking options:
https://www.mathnet.ru/eng/znsl5235 https://www.mathnet.ru/eng/znsl/v402/p9
|
Statistics & downloads: |
Abstract page: | 387 | Full-text PDF : | 131 | References: | 47 |
|