|
Zapiski Nauchnykh Seminarov POMI, 2012, Volume 402, Pages 83–90
(Mi znsl5239)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Synchronizing random automata on $4$-letter alphabet
Yu. I. Zaks, E. S. Skvortsov Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russia
Abstract:
The paper deals with the synchronization of a random automaton that is sampled uniformly at random from the set of all automata with $n$ states and $m$ letters. We show that for $m=4$ the probability that a random automaton is synchronizing is larger than a positive constant.
Key words and phrases:
syncronizing automaton, random automaton, Cerny conjecture.
Received: 25.08.2012
Citation:
Yu. I. Zaks, E. S. Skvortsov, “Synchronizing random automata on $4$-letter alphabet”, Combinatorics and graph theory. Part IV, RuFiDiM'11, Zap. Nauchn. Sem. POMI, 402, POMI, St. Petersburg, 2012, 83–90; J. Math. Sci. (N. Y.), 192:3 (2013), 303–306
Linking options:
https://www.mathnet.ru/eng/znsl5239 https://www.mathnet.ru/eng/znsl/v402/p83
|
Statistics & downloads: |
Abstract page: | 169 | Full-text PDF : | 61 | References: | 66 |
|