{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:05:15Z","timestamp":1725613515848},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642242878"},{"type":"electronic","value":"9783642242885"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24288-5_16","type":"book-chapter","created":{"date-parts":[[2011,9,24]],"date-time":"2011-09-24T01:46:57Z","timestamp":1316828817000},"page":"180-190","source":"Crossref","is-referenced-by-count":4,"title":["Lower Bounds for the Length of Reset Words in Eulerian Automata"],"prefix":"10.1007","author":[{"given":"Vladimir V.","family":"Gusev","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-15155-2_7","volume-title":"Mathematical Foundations of Computer Science 2010","author":"D.S. Ananichev","year":"2010","unstructured":"Ananichev, D.S., Gusev, V.V., Volkov, M.V.: Slowly synchronizing automata and digraphs. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 55\u201365. Springer, Heidelberg (2010)"},{"issue":"3","key":"16_CR2","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. Matem.-fyzikalny \u010casopis Slovensk. Akad. Vied\u00a014(3), 208\u2013216 (1964) (in Slovak)","journal-title":"Matem.-fyzikalny \u010casopis Slovensk. Akad. Vied"},{"key":"16_CR3","doi-asserted-by":"publisher","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":"16_CR4","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":"16_CR5","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":"16_CR6","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":"16_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0024-3795(02)00365-8","volume":"356","author":"D.D. Olesky","year":"2002","unstructured":"Olesky, D.D., Shader, B., van den Driessche, P.: Exponents of tuples of nonnegative matrices. Linear Algebra Appl.\u00a0356, 123\u2013134 (2002)","journal-title":"Linear Algebra Appl."},{"key":"16_CR8","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":"16_CR9","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":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol.\u00a03472, pp. 5\u201333. Springer, Heidelberg (2005)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0024-3795(01)00566-3","volume":"363","author":"B.L. Shader","year":"2003","unstructured":"Shader, B.L., Suwilo, S.: Exponents of nonnegative matrix pairs. Linear Algebra Appl.\u00a0363, 275\u2013293 (2003)","journal-title":"Linear Algebra Appl."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0012-365X(99)00144-2","volume":"214","author":"J. Shen","year":"2000","unstructured":"Shen, J.: Exponents of 2-regular digraphs. Discrete Math.\u00a0214, 211\u2013219 (2000)","journal-title":"Discrete Math."},{"issue":"2","key":"16_CR13","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":"16_CR14","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":"16_CR15","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":"16_CR16","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/BF02230720","volume":"52","author":"H. Wielandt","year":"1950","unstructured":"Wielandt, H.: Unzerlegbare, nicht negative Matrizen. Math. Z.\u00a052, 642\u2013648 (1950) (in German)","journal-title":"Math. Z."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24288-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T16:53:59Z","timestamp":1554656039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24288-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242878","9783642242885"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24288-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}