{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:48:49Z","timestamp":1764557329809,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480564"},{"type":"electronic","value":"9783662480571"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48057-1_26","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T01:29:54Z","timestamp":1439170194000},"page":"331-343","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Synchronizing Automata with Extremal Properties"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Kisielewicz","sequence":"first","affiliation":[]},{"given":"Marek","family":"Szyku\u0142a","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"26_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 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":"3","key":"26_CR2","doi-asserted-by":"publisher","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."},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/11779148_39","volume-title":"Developments in Language Theory","author":"DS Ananichev","year":"2006","unstructured":"Ananichev, D.S., Volkov, M.V., Zaks, Y.I.: Synchronizing automata with a letter of deficiency 2. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 433\u2013442. Springer, Heidelberg (2006)"},{"issue":"2","key":"26_CR4","doi-asserted-by":"publisher","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. Foundations Comput. Sci. 22(2), 277\u2013288 (2011)","journal-title":"Int. J. Foundations Comput. Sci."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Berlinkov, M., Szyku\u0142a, M.: Algebraic synchronization criterion and computing reset words. In: Italiano, G.F., et al (eds.) MFCS 2015. Lecture Notes in Computer Science, vol. 9234, pp. 103\u2013115 (2015)","DOI":"10.1007\/978-3-662-48057-1_8"},{"issue":"7","key":"26_CR6","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1142\/S012905411100888X","volume":"22","author":"MV Berlinkov","year":"2011","unstructured":"Berlinkov, M.V.: On a conjecture by Carpi and D\u2019Alessandro. Int. J. Foundations Comput. Sci. 22(7), 1565\u20131576 (2011)","journal-title":"Int. J. Foundations Comput. Sci."},{"issue":"6","key":"26_CR7","doi-asserted-by":"publisher","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. Foundations Comput. Sci. 24(6), 729\u2013745 (2013)","journal-title":"Int. J. Foundations Comput. Sci."},{"issue":"3","key":"26_CR8","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-fyzik\u00e1lny \u010cas. Slovenskej Akad. Vied 14(3), 208\u2013216 (1964). in Slovak","journal-title":"Matematicko-fyzik\u00e1lny \u010cas. Slovenskej Akad. Vied"},{"key":"26_CR9","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). in French","journal-title":"Informatique th\u00e9orique et Appl."},{"issue":"1","key":"26_CR10","first-page":"307","volume":"17","author":"F Gonze","year":"2015","unstructured":"Gonze, F., Jungers, R.M., Trahtman, A.N.: A note on a recent attempt to improve the Pin-Frankl bound. Discrete Math. Theoret. Comput. Sci. 17(1), 307\u2013308 (2015)","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"26_CR11","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":"26_CR12","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. 295(1\u20133), 223\u2013232 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR13","unstructured":"Kari, J., Volkov, M.V.: \u010cern\u00fd\u2019s conjecture and the road coloring problem. In: Handbook of Automata. European Science Foundation (2013, to appear)"},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","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. Comb. Optim. 29(1), 88\u2013124 (2015)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"26_CR15","first-page":"141","volume":"13","author":"A Roman","year":"2008","unstructured":"Roman, A.: A note on \u010cern\u00fd conjecture for automata over 3-letter alphabet. J. Automata Lang. Comb. 13(2), 141\u2013143 (2008)","journal-title":"J. Automata Lang. Comb."},{"issue":"2","key":"26_CR16","first-page":"145","volume":"12","author":"IK Rystsov","year":"1995","unstructured":"Rystsov, I.K.: Quasioptimal bound for the length of reset words for regular automata. Acta Cybernetica 12(2), 145\u2013152 (1995)","journal-title":"Acta Cybernetica"},{"issue":"7","key":"26_CR17","doi-asserted-by":"publisher","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. Foundations Comput. Sci. 22(7), 1697\u20131706 (2011)","journal-title":"Int. J. Foundations Comput. Sci."},{"issue":"39","key":"26_CR18","doi-asserted-by":"publisher","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. Theoret. Comput. Sci. 412(39), 5487\u20135491 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR19","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":"AN Trahtman","year":"2006","unstructured":"Trahtman, A.N.: An efficient algorithm finds noticeable trends and examples concerning the \u010cerny conjecture. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 789\u2013800. Springer, Heidelberg (2006)"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-22953-4_15","volume-title":"Fundamentals of Computation Theory","author":"AN Trahtman","year":"2011","unstructured":"Trahtman, A.N.: Modifying the upper bound on the length of minimal synchronizing word. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 173\u2013180. Springer, Heidelberg (2011)"},{"key":"26_CR21","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":"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)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48057-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:16:27Z","timestamp":1676960187000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-662-48057-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480564","9783662480571"],"references-count":21,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-662-48057-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}