{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:49:18Z","timestamp":1764557358753},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319409450"},{"type":"electronic","value":"9783319409467"}],"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-319-40946-7_15","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T07:52:20Z","timestamp":1467705140000},"page":"176-188","source":"Crossref","is-referenced-by-count":5,"title":["Experiments with Synchronizing Automata"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Kisielewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Kowalski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Szyku\u0142a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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-Pin conjecture. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 67\u201380. Springer, Heidelberg (2009)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/11505877_10","volume-title":"Developments in Language Theory","author":"DS Ananichev","year":"2005","unstructured":"Ananichev, D.S.: The mortality threshold for partially monotonic automata. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 112\u2013121. Springer, Heidelberg (2005)"},{"key":"15_CR3","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":"3","key":"15_CR4","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":"15_CR5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1142\/S0129054111008039","volume":"22","author":"M-P 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."},{"key":"15_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)"},{"key":"15_CR7","unstructured":"Cardoso, \u00c2.: The \u010cern\u00fd Conjecture and Other Synchronization Problems. Ph.D. thesis, University of Porto, Portugal (2014)"},{"issue":"3","key":"15_CR8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.aam.2012.07.003","volume":"50","author":"A Carpi","year":"2013","unstructured":"Carpi, A., D\u2019Alessandro, F.: Independent sets of words and the synchronization problem. Adv. Appl. Math. 50(3), 339\u2013355 (2013)","journal-title":"Adv. Appl. Math."},{"issue":"3","key":"15_CR9","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 \u010casopis Slovenskej Akad\u00e9mie Vied 14(3), 208\u2013216 (1964)","journal-title":"Matematicko-fyzik\u00e1lny \u010casopis Slovenskej Akad\u00e9mie Vied"},{"key":"15_CR10","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 C\u0306ern\u00fd. Informatique th\u00e9orique et applications 32, 21\u201334 (1998)","journal-title":"Informatique th\u00e9orique et applications"},{"key":"15_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."},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0195-6698(82)80025-5","volume":"3","author":"P Frankl","year":"1982","unstructured":"Frankl, P.: An extremal problem for two families of sets. Eur. J. Comb. 3, 125\u2013127 (1982)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"15_CR13","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. Theor. Comput. Sci. 17(1), 307\u2013308 (2015)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"15_CR14","first-page":"146","volume":"73","author":"J Kari","year":"2001","unstructured":"Kari, J.: A counter example to a conjecture concerning synchronizing word in finite. EATCS Bull. 73, 146\u2013147 (2001)","journal-title":"EATCS Bull."},{"key":"15_CR15","unstructured":"Kari, J., Volkov, M.V.: \u010cern\u00fd\u2019s conjecture and the road coloring problem. In: Handbook of Automata. European Science Foundation (2013)"},{"key":"15_CR16","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":"15_CR17","unstructured":"Kisielewicz, A., Szyku\u0142a, M.: Generating Synchronizing Automata with Large Reset Lengths (2016). http:\/\/arxiv.org\/abs\/1404.3311"},{"key":"15_CR18","unstructured":"Pin, J.-E.: Utilisation de l\u2019alg\u00e8bre lin\u00e9aire en th\u00e9orie des automates. In: Actes du 1er Colloque AFCET-SMF de Math\u00e9matiques Appliqu\u00e9es II, pp. 85\u201392 (1978)"},{"key":"15_CR19","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":"7","key":"15_CR20","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":"15_CR21","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. Theoret. Comput. Sci. 412(39), 5487\u20135491 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"15_CR24","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)"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Vorel, V.: Subset synchronization of transitive automata. In: AFL, pp. 370\u2013381 (2014)","DOI":"10.4204\/EPTCS.151.26"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40946-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T14:29:40Z","timestamp":1568125780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}