{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:42:57Z","timestamp":1743003777839,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"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:\/\/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:\/\/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-319-15579-1_16","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"212-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Synchronizing Probability Function and the Triple Rendezvous Time"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Gonze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rapha\u00ebl M.","family":"Jungers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"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 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":"16_CR2","doi-asserted-by":"publisher","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. Theoretical Computer Science 330(1), 3\u201313 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"16_CR3","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. International Journal of Foundations of Computer Science 22(2), 277\u2013288 (2011)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-14455-4_8","volume-title":"Developments in Language Theory","author":"MV Berlinkov","year":"2010","unstructured":"Berlinkov, M.V.: On a conjecture by Carpi and D\u2019Alessandro. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 66\u201375. Springer, Heidelberg (2010)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge University Press, New York (2004)","DOI":"10.1017\/CBO9780511804441"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","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. Advances in Applied Mathematics 50(3), 339\u2013355 (2013)","journal-title":"Advances in Applied Mathematics"},{"key":"16_CR7","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-fysikalny Casopis SAV 14, 208\u2013216 (1964)","journal-title":"Matematicko-fysikalny Casopis SAV"},{"key":"16_CR8","first-page":"289","volume":"7","author":"J \u010cern\u00fd","year":"1971","unstructured":"\u010cern\u00fd, J., Pirick\u00e1, A., Rosenauerova, B.: On directable automata. Kybernetica 7, 289\u2013298 (1971)","journal-title":"Kybernetica"},{"key":"16_CR9","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 Informatique Theorique et Appliqu\u00e9e 32, 21\u201334 (1998)","journal-title":"RAIRO Informatique Theorique et Appliqu\u00e9e"},{"issue":"3","key":"16_CR10","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 Journal on Computing 19(3), 500\u2013510 (1990). http:\/\/www.citeseer.ist.psu.edu\/eppstein90reset.html","journal-title":"SIAM Journal on Computing"},{"key":"16_CR11","doi-asserted-by":"publisher","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. European Journal on Combinatorics 3, 125\u2013127 (1982)","journal-title":"European Journal on Combinatorics"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Gonze, F., Jungers, R.M.: On the synchronizing probability function and the triple rendezvous time for synchronizing automata (2014) ArXiv preprint. http:\/\/arxiv.org\/abs\/1410.4034","DOI":"10.1007\/978-3-319-15579-1_16"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/100816109","volume":"26","author":"RM Jungers","year":"2012","unstructured":"Jungers, R.M.: The synchronizing probability function of an automaton. SIAM Journal on Discrete Mathematics 26(1), 177\u2013192 (2012)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"16_CR14","first-page":"146","volume":"73","author":"J Kari","year":"2001","unstructured":"Kari, J.: A counter example to a conjecture concerning synchronizing words in finite automata. EATCS Bulletin 73, 146 (2001)","journal-title":"EATCS Bulletin"},{"key":"16_CR15","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. Theoretical Computer Science 295, 223\u2013232 (2003)","journal-title":"Theoretical Computer Science"},{"key":"16_CR16","first-page":"535","volume":"17","author":"JE Pin","year":"1983","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. Annals of Discrete Mathematics 17, 535\u2013548 (1983)","journal-title":"Annals of Discrete Mathematics"},{"key":"16_CR17","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"2","key":"16_CR18","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. Journal of Automata, Languages and Combinatorics 13(2), 141\u2013143 (2008)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/978-3-642-00982-2_58","volume-title":"Language and Automata Theory and Applications","author":"A Roman","year":"2009","unstructured":"Roman, A.: Genetic algorithm for synchronization. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 684\u2013695. Springer, Heidelberg (2009)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-14455-4_38","volume-title":"Developments in Language Theory","author":"B Steinberg","year":"2010","unstructured":"Steinberg, B.: The averaging trick and the \u010cern\u00fd conjecture. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 423\u2013431. Springer, Heidelberg (2010)"},{"key":"16_CR21","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)"},{"issue":"2","key":"16_CR22","first-page":"3","volume":"9","author":"AN Trahtman","year":"2007","unstructured":"Trahtman, A.N.: The \u010cern\u00fd conjecture for aperiodic automata. Discrete mathematics and Theoretical Computer Science 9(2), 3\u201310 (2007)","journal-title":"Discrete mathematics and Theoretical Computer Science"},{"key":"16_CR23","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":"16_CR24","doi-asserted-by":"crossref","unstructured":"Blondel, V., Jungers, R.M., Olshevsky, A.: On primitivity of sets of matrices (2014) ArXiv preprint. http:\/\/arxiv.org\/abs\/1306.0729","DOI":"10.1109\/CDC.2013.6760072"},{"key":"16_CR25","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","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T07:49:19Z","timestamp":1675842559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_16"}},"subtitle":["New Approaches to \u010cern\u00fd\u2019s Conjecture"],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_16","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":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}