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. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Gusev, V. V., & Pribavkina, E. V. (2014). Reset thresholds of automata with two cycle lengths. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8587 LNCS, pp. 200–210). Springer Verlag. https://doi.org/10.1007/978-3-319-08846-4_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
