{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:28:07Z","timestamp":1774625287831,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642151545","type":"print"},{"value":"9783642151552","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_7","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"55-65","source":"Crossref","is-referenced-by-count":24,"title":["Slowly Synchronizing Automata and Digraphs"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Ananichev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Gusev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Volkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02761605","volume":"27","author":"R.L. Adler","year":"1977","unstructured":"Adler, R.L., Goodwyn, L.W., Weiss, B.: Equivalence of topological Markov shifts. Israel J. Math.\u00a027, 49\u201363 (1977)","journal-title":"Israel J. Math."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-02737-6_5","volume-title":"Developments in Language Theory","author":"J. Almeida","year":"2009","unstructured":"Almeida, J., Steinberg, B.: Matrix mortality and the \u010cern\u00fd\u2013Pin conjecture. In: Diekert, V., Nowotka, D. (eds.) Developments in Language Theory. LNCS, vol.\u00a05583, pp. 67\u201380. Springer, Heidelberg (2009)"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.tcs.2007.07.029","volume":"387","author":"M. Almeida","year":"2007","unstructured":"Almeida, M., Moreira, N., Reis, R.: Enumeration and generation with a string automata representation. Theor. Comput. Sci.\u00a0387, 93\u2013102 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2007.01.010","volume":"376","author":"D.S. Ananichev","year":"2007","unstructured":"Ananichev, D.S., Volkov, M.V., Zaks, Y.I.: Synchronizing automata with a letter of deficiency 2. Theor. Comput. Sci.\u00a0376, 30\u201341 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"7_CR5","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym eksperimentom s kone\u010dn\u00fdmi automatami. Matematicko-fyzikalny \u010casopis Slovensk. Akad. Vied\u00a014(3), 208\u2013216 (1964) (in Slovak)","journal-title":"Matematicko-fyzikalny \u010casopis Slovensk. Akad. Vied"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1998321-300211","volume":"32","author":"L. Dubuc","year":"1998","unstructured":"Dubuc, L.: Sur les automates circulaires et la conjecture de \u010cern\u00fd. RAIRO Inform. Th\u00e9or. Appl.\u00a032, 21\u201334 (1998) (in French)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.4153\/CMB-1962-023-2","volume":"5","author":"A.L. Dulmage","year":"1962","unstructured":"Dulmage, A.L., Mendelsohn, N.S.: The exponent of a primitive matrix. Can. Math. Bull.\u00a05, 241\u2013244 (1962)","journal-title":"Can. Math. Bull."},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1215\/ijm\/1256059464","volume":"8","author":"A.L. Dulmage","year":"1964","unstructured":"Dulmage, A.L., Mendelsohn, N.S.: Gaps in the exponent set of primitive matrices. Ill. J. Math.\u00a08, 642\u2013656 (1964)","journal-title":"Ill. J. Math."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0219033","volume":"19","author":"D. Eppstein","year":"1990","unstructured":"Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput.\u00a019, 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF02573120","volume":"37","author":"P.M. Higgins","year":"1988","unstructured":"Higgins, P.M.: The range order of a product of i transformations from a finite full transformation semigroup. Semigroup Forum\u00a037, 31\u201336 (1988)","journal-title":"Semigroup Forum"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(02)00405-X","volume":"295","author":"J. Kari","year":"2003","unstructured":"Kari, J.: Synchronizing finite automata on Eulerian digraphs. Theoret. Comput. Sci.\u00a0295, 223\u2013232 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR12","unstructured":"Pin, J.-E.: Le probl\u00e8me de la synchronization et la conjecture de \u010cern\u00fd. Th\u00e8se de 3\u00e8me cycle. Universit\u00e9 de Paris 6 (1978) (in French)"},{"key":"7_CR13","first-page":"535","volume":"17","author":"J.-E. Pin","year":"1983","unstructured":"Pin, J.-E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math.\u00a017, 535\u2013548 (1983)","journal-title":"Ann. Discrete Math."},{"key":"7_CR14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198568209.001.0001","volume-title":"The diophantine Frobenius problem","author":"J.L. Ram\u00edrez Alfons\u00edn","year":"2005","unstructured":"Ram\u00edrez Alfons\u00edn, J.L.: The diophantine Frobenius problem. Oxford University Press, Oxford (2005)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/11498490_2","volume-title":"Model-Based Testing of Reactive Systems","author":"S. Sandberg","year":"2005","unstructured":"Sandberg, S.: Homing and synchronizing sequences. In: Broy, M., et al. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol.\u00a03472, pp. 5\u201333. Springer, Heidelberg (2005)"},{"key":"7_CR16","unstructured":"Skvortsov, E., Yu, Z.: Synchronizing random automata. In: Rigo, M. (ed.) AutoMathA 2009, Universit\u00e9 de Li\u00e8ge (2009) (submitted)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/11821069_68","volume-title":"Mathematical Foundations of Computer Science 2006","author":"A.N. Trahtman","year":"2006","unstructured":"Trahtman, A.N.: An efficient algorithm finds noticeable trends and examples concerning the \u010cern\u00fd conjecture. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 789\u2013800. Springer, Heidelberg (2006)"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.endm.2006.06.072","volume":"25","author":"A.N. Trahtman","year":"2006","unstructured":"Trahtman, A.N.: Notable trends concerning the synchronization of graphs and automata. Electr. Notes Discrete Math.\u00a025, 173\u2013175 (2006)","journal-title":"Electr. Notes Discrete Math."},{"issue":"2","key":"7_CR19","first-page":"3","volume":"9","author":"A.N. Trahtman","year":"2007","unstructured":"Trahtman, A.N.: The \u010cern\u00fd conjecture for aperiodic automata. Discrete Math. Theor. Comput. Sci.\u00a09(2), 3\u201310 (2007)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s11390-008-9165-4","volume":"23","author":"A.N. Trahtman","year":"2008","unstructured":"Trahtman, A.N.: Some aspects of synchronization of DFA. J. Comput. Sci. Technol.\u00a023, 719\u2013727 (2008)","journal-title":"J. Comput. Sci. Technol."},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s11856-009-0062-5","volume":"172","author":"A.N. Trahtman","year":"2009","unstructured":"Trahtman, A.N.: The Road Coloring Problem. Israel J. Math.\u00a0172, 51\u201360 (2009)","journal-title":"Israel J. Math."},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"M.V. Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing automata and the \u010cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 11\u201327. Springer, Heidelberg (2008)"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"2992","DOI":"10.1016\/j.tcs.2009.03.021","volume":"410","author":"M.V. Volkov","year":"2009","unstructured":"Volkov, M.V.: Synchronizing automata preserving a chain of partial orders. Theoret. Comput. Sci.\u00a0410, 2992\u20132998 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR24","unstructured":"Wielandt, H.: Unzerlegbare, nicht negative Matrizen. Math. Z. 52, 642\u2013648 (1950) (in German)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:51Z","timestamp":1606186911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}