{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:48:08Z","timestamp":1743029288670,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531310"},{"type":"electronic","value":"9783662531327"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53132-7_31","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T21:25:06Z","timestamp":1468963506000},"page":"380-392","source":"Crossref","is-referenced-by-count":3,"title":["An Extremal Series of Eulerian Synchronizing Automata"],"prefix":"10.1007","author":[{"given":"Marek","family":"Szyku\u0142a","sequence":"first","affiliation":[]},{"given":"Vojt\u011bch","family":"Vorel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-642-15155-2_7","volume-title":"Mathematical Foundations of Computer Science 2010","author":"D Ananichev","year":"2010","unstructured":"Ananichev, D., Gusev, V., Volkov, M.: Slowly synchronizing automata and digraphs. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 55\u201365. Springer, Heidelberg (2010)"},{"issue":"1","key":"31_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2004.09.006","volume":"330","author":"DS Ananichev","year":"2005","unstructured":"Ananichev, D.S., Volkov, M.V.: Synchronizing generalized monotonic automata. Theor. Comput. Sci. 330(1), 3\u201313 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"31_CR3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10958-013-1392-8","volume":"192","author":"DS Ananichev","year":"2013","unstructured":"Ananichev, D.S., Volkov, M.V., Gusev, V.V.: Primitive digraphs with large exponents and slowly synchronizing automata. J. Math. Sci. 192(3), 263\u2013278 (2013)","journal-title":"J. Math. Sci."},{"issue":"2","key":"31_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1142\/S0129054111008039","volume":"22","author":"MP B\u00e9al","year":"2011","unstructured":"B\u00e9al, M.P., Berlinkov, M.V., Perrin, D.: A quadratic upper bound on the size of a synchronizing word in one-cluster automata. Int. J. Found. Comput. Sci. 22(2), 277\u2013288 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"6","key":"31_CR5","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1142\/S0129054113400157","volume":"24","author":"MV Berlinkov","year":"2013","unstructured":"Berlinkov, M.V.: Synchronizing quasi-Eulerian and quasi-one-cluster Automata. Int. J. Found. Comput. Sci. 24(6), 729\u2013745 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-662-48057-1_8","volume-title":"Mathematical Foundations of Computer Science 2015","author":"M Berlinkov","year":"2015","unstructured":"Berlinkov, M., Szyku\u0142a, M.: Algebraic synchronization criterion and computing reset words. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 103\u2013115. Springer, Heidelberg (2015)"},{"issue":"38\u201340","key":"31_CR7","doi-asserted-by":"crossref","first-page":"3925","DOI":"10.1016\/j.tcs.2009.06.005","volume":"410","author":"MT Biskup","year":"2009","unstructured":"Biskup, M.T., Plandowski, W.: Shortest synchronizing strings for Huffman codes. Theor. Comput. Sci. 410(38\u201340), 3925\u20133941 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"31_CR8","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s00236-009-0106-7","volume":"46","author":"A Carpi","year":"2009","unstructured":"Carpi, A., D\u2019Alessandro, F.: Strongly transitive automata and the \u010cern\u00fd conjecture. Acta Informatica 46(8), 591\u2013607 (2009)","journal-title":"Acta Informatica"},{"issue":"3","key":"31_CR9","first-page":"208","volume":"14","author":"J \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym experimentom s kone\u010dn\u00fdmi automatmi. Matematicko-fyzik\u00e1lny \u010casopis Slovenskej Akad\u00e9mie Vied 14(3), 208\u2013216 (1964)","journal-title":"Matematicko-fyzik\u00e1lny \u010casopis Slovenskej Akad\u00e9mie Vied"},{"key":"31_CR10","first-page":"21","volume":"32","author":"L Dubuc","year":"1998","unstructured":"Dubuc, L.: Sur les automates circulaires et la conjecture de C\u0306ern\u00fd. Informatique Th\u00e9orique et Appl. 32, 21\u201334 (1998)","journal-title":"Informatique Th\u00e9orique et Appl."},{"key":"31_CR11","doi-asserted-by":"crossref","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. 19, 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"31_CR12","first-page":"61","volume":"15","author":"M Grech","year":"2013","unstructured":"Grech, M., Kisielewicz, A.: The \u010cern\u00fd conjecture for automata respecting intervals of a directed graph. Discr. Math. Theor. Comput. Sci. 15(3), 61\u201372 (2013)","journal-title":"Discr. Math. Theor. Comput. Sci."},{"issue":"2","key":"31_CR13","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1142\/S0129054113400108","volume":"24","author":"V Gusev","year":"2013","unstructured":"Gusev, V.: Lower bounds for the length of reset words in Eulerian automata. Int. J. Found. Comput. Sci. 24(2), 251\u2013262 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-319-08846-4_15","volume-title":"Implementation and Application of Automata","author":"VV Gusev","year":"2014","unstructured":"Gusev, V.V., Pribavkina, E.V.: Reset thresholds of automata with two cycle lengths. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 200\u2013210. Springer, Heidelberg (2014)"},{"issue":"1\u20133","key":"31_CR15","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 295(1\u20133), 223\u2013232 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR16","unstructured":"Kari, J., Volkov, M.V.: \u010cern\u00fd\u2019s conjecture and the road coloring problem. In: Handbook of Automata, European Science Foundation (2013)"},{"issue":"1","key":"31_CR17","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/s10878-013-9682-0","volume":"29","author":"A Kisielewicz","year":"2015","unstructured":"Kisielewicz, A., Kowalski, J., Szyku\u0142a, M.: Computing the shortest reset words of synchronizing automata. J. Combin. Optim. 29(1), 88\u2013124 (2015)","journal-title":"J. Combin. Optim."},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/978-3-642-39274-0_30","volume-title":"Implementation and Application of Automata","author":"A Kisielewicz","year":"2013","unstructured":"Kisielewicz, A., Szyku\u0142a, M.: Generating small automata and the \u010cern\u00fd conjecture. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol. 7982, pp. 340\u2013348. Springer, Heidelberg (2013)"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-3-662-48057-1_26","volume-title":"Mathematical Foundations of Computer Science 2015","author":"A Kisielewicz","year":"2015","unstructured":"Kisielewicz, A., Szyku\u0142a, M.: Synchronizing automata with extremal properties. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 331\u2013343. Springer, Heidelberg (2015)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-319-40946-7_15","volume-title":"Implementation and Application of Automata","author":"A Kisielewicz","year":"2016","unstructured":"Kisielewicz, A., Kowalski, J., Szykula, M.: Experiments with synchronizing automata. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 176\u2013188. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-40946-7_15"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. In: Proceedings of the International Colloquium on Graph Theory and Combinatorics. North-Holland Mathematics Studies, vol. 75, pp. 535\u2013548 (1983)","DOI":"10.1016\/S0304-0208(08)73432-7"},{"issue":"3","key":"31_CR22","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02732984","volume":"36","author":"IK Rystsov","year":"2000","unstructured":"Rystsov, I.K.: Estimation of the length of reset words for automata with simple idempotents. Cybern. Syst. Anal. 36(3), 339\u2013344 (2000)","journal-title":"Cybern. Syst. Anal."},{"issue":"7","key":"31_CR23","doi-asserted-by":"crossref","first-page":"1697","DOI":"10.1142\/S0129054111008970","volume":"22","author":"B Steinberg","year":"2011","unstructured":"Steinberg, B.: The averaging trick and the \u010cern\u00fd conjecture. Int. J. Found. Comput. Sci. 22(7), 1697\u20131706 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"39","key":"31_CR24","doi-asserted-by":"crossref","first-page":"5487","DOI":"10.1016\/j.tcs.2011.06.012","volume":"412","author":"B Steinberg","year":"2011","unstructured":"Steinberg, B.: The \u010cern\u00fd conjecture for one-cluster automata with prime length cycle. Theor. Comput. Sci. 412(39), 5487\u20135491 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"31_CR25","first-page":"3","volume":"9","author":"AN Trahtman","year":"2007","unstructured":"Trahtman, A.N.: The C\u0306ern\u00fd conjecture for aperiodic automata. Discr. Math. Theor. Comput. Sci. 9(2), 3\u201310 (2007)","journal-title":"Discr. Math. Theor. Comput. Sci."},{"key":"31_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"MV 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. 5196, pp. 11\u201327. Springer, Heidelberg (2008)"},{"issue":"37","key":"31_CR27","doi-asserted-by":"crossref","first-page":"3513","DOI":"10.1016\/j.tcs.2009.03.021","volume":"410","author":"MV Volkov","year":"2009","unstructured":"Volkov, M.V.: Synchronizing automata preserving a chain of partial orders. Theor. Comput. Sci. 410(37), 3513\u20133519 (2009)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53132-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:45:57Z","timestamp":1498315557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}