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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ananichev, D.S., Gusev, V.V., Volkov, M.V.: Primitive digraphs with large exponents and slowly synchronizing automata. Journal of Mathematical Sciences (US) 192(3), 263–278 (2013)
Ananichev, D.S., Volkov, M.V., Zaks, Y.I.: Synchronizing automata with a letter of deficiency 2. Theor. Comput. Sci. 376, 30–41 (2007)
Brualdi, R., Ryser, H.: Combinatorial matrix theory. Cambridge University Press (1991)
Černý, J.: Poznámka k homogénnym eksperimentom s konečnými automatami. Mat. -Fyz. Cas. Slovensk. Akad. Vied. 14, 208–216 (1964)
Dulmage, A.L., Mendelsohn, N.S.: Gaps in the exponent set of primitive matrices. Illinois J. Math. 8(4), 642–656 (1964)
Kisielewicz, A., Szykuła, M.: Generating Small Automata and the Černý Conjecture. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol. 7982, pp. 340–348. Springer, Heidelberg (2013)
Lewin, M., Vitek, Y.: A system of gaps in the exponent set of primitive matrices. Illinois J. Math. 25, 87–98 (1981)
Pin, J.-E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math. 17, 535–548 (1983)
Ramírez Alfonsín, J.L.: The diophantine Frobenius problem. Oxford University Press (2005)
Sandberg, S.: Homing and synchronizing sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 5–33. Springer, Heidelberg (2005)
Trahtman, A.N.: Notable trends concerning the synchronization of graphs and automata. Electr. Notes Discrete Math. 25, 173–175 (2006)
Trahtman, A.N.: The Road Coloring Problem. Israel J. Math. 172, 51–60 (2009)
Volkov, M.V.: Synchronizing automata and the Černý conjecture. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11–27. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Gusev, V.V., Pribavkina, E.V. (2014). Reset Thresholds of Automata with Two Cycle Lengths. In: Holzer, M., Kutrib, M. (eds) Implementation and Application of Automata. CIAA 2014. Lecture Notes in Computer Science, vol 8587. Springer, Cham. https://doi.org/10.1007/978-3-319-08846-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-08846-4_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08845-7
Online ISBN: 978-3-319-08846-4
eBook Packages: Computer ScienceComputer Science (R0)