Reset thresholds of automata with two cycle lengths
Formal Languages and Automata Theory
2014-03-18 v1
Abstract
We present several series of synchronizing automata with multiple parameters, generalizing previously known results. Let p and q be two arbitrary co-prime positive integers, q > p. We describe reset thresholds of the colorings of primitive digraphs with exactly one cycle of length p and one cycle of length q. Also, we study reset thresholds of the colorings of primitive digraphs with exactly one cycle of length q and two cycles of length p.
Cite
@article{arxiv.1403.3992,
title = {Reset thresholds of automata with two cycle lengths},
author = {Vladimir V. Gusev and Elena V. Pribavkina},
journal= {arXiv preprint arXiv:1403.3992},
year = {2014}
}
Comments
11 pages, 5 figures, submitted to CIAA 2014