{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:47:21Z","timestamp":1743097641920,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_16","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"194-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Synchronizing Probability Function for Primitive Sets of Matrices"],"prefix":"10.1007","author":[{"given":"Costanza","family":"Catalano","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":[[2018,8,5]]},"reference":[{"issue":"5","key":"16_CR1","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/s10958-015-2390-9","volume":"207","author":"YA Alpin","year":"2015","unstructured":"Alpin, Y.A., Alpina, V.S.: Combinatorial properties of entire semigroups of nonnegative matrices. J. Math. Sci. 207(5), 674\u2013685 (2015)","journal-title":"J. Math. Sci."},{"issue":"3","key":"16_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":"16_CR3","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.automatica.2015.07.026","volume":"61","author":"VD Blondel","year":"2015","unstructured":"Blondel, V.D., Jungers, R.M., Olshevsky, A.: On primitivity of sets of matrices. Automatica 61, 80\u201388 (2015)","journal-title":"Automatica"},{"key":"16_CR4","unstructured":"Catalano, C., Jungers, R.M.: On randomized generation of slowly synchronizing automata. In: 43rd International Symposium on Mathematical Foundations of Computer Science (2018, to appear)"},{"issue":"5","key":"16_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01192046","volume":"14","author":"YB Chen","year":"1995","unstructured":"Chen, Y.B., Ierardi, D.J.: The complexity of oblivious plans for orienting and distinguishing polygonal parts. Algorithmica 14(5), 367\u2013397 (1995)","journal-title":"Algorithmica"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Chevalier, P.Y., Hendrickx, J.M., Jungers, R.M.: Reachability of consensus and synchronizing automata. In: 4th IEEE Conference on Decision and Control, pp. 4139\u20134144 (2015)","DOI":"10.1109\/CDC.2015.7402864"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-319-62809-7_8","volume-title":"Developments in Language Theory","author":"M Bondt de","year":"2017","unstructured":"de Bondt, M., Don, H., Zantema, H.: DFAs and PFAs with long shortest synchronizing word length. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 122\u2013133. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-62809-7_8"},{"key":"16_CR8","unstructured":"Dzyga, M., Ferens, R., Gusev, V.V., Szyku\u0142a, M.: Attainable values of reset thresholds. In: 42nd International Symposium on Mathematical Foundations of Computer Science, pp. 40:1\u201340:14 (2017)"},{"issue":"3","key":"16_CR9","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. 19(3), 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"16_CR10","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. Eur. J. Comb. 3(3), 125\u2013127 (1982)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/16M1094099","volume":"39","author":"B Gerencs\u00e9r","year":"2018","unstructured":"Gerencs\u00e9r, B., Gusev, V.V., Jungers, R.M.: Primitive sets of nonnegative matrices and synchronizing automata. SIAM J. Matrix Anal. Appl. 39(1), 83\u201398 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-319-15579-1_16","volume-title":"Language and Automata Theory and Applications","author":"F Gonze","year":"2015","unstructured":"Gonze, F., Jungers, R.M.: On the synchronizing probability function and the triple rendezvous time. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 212\u2013223. Springer, Cham (2015). \n                    https:\/\/doi.org\/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 J. Discrete Math. 26(1), 177\u2013192 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). \n                    https:\/\/doi.org\/10.1007\/978-3-662-48057-1_26"},{"key":"16_CR15","unstructured":"Mateescu, A., Salomaa, A.: Many-valued truth functions, \u010cern\u00fd conjecture and road coloring. In: Bulletin of the European Association of Theoretical Computer Science, pp. 134\u2013150 (1999)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-642-15155-2_50","volume-title":"Mathematical Foundations of Computer Science 2010","author":"J Olschewski","year":"2010","unstructured":"Olschewski, J., Ummels, M.: The complexity of finding reset words in finite automata. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 568\u2013579. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-15155-2_50"},{"key":"16_CR17","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, vol. 75, pp. 535\u2013548 (1983)","DOI":"10.1016\/S0304-0208(08)73432-7"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"4448","DOI":"10.1016\/j.laa.2013.01.027","volume":"438","author":"VY Protasov","year":"2013","unstructured":"Protasov, V.Y., Jungers, R.M.: Lower and upper bounds for the largest Lyapunov exponent of matrices. Linear Algebra Appl. 438, 4448\u20134468 (2013)","journal-title":"Linear Algebra Appl."},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1016\/j.laa.2012.02.029","volume":"437","author":"VY Protasov","year":"2012","unstructured":"Protasov, V.Y., Voynov, A.S.: Sets of nonnegative matrices without positive products. Linear Algebra Appl. 437, 749\u2013765 (2012)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"16_CR20","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"DA Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.H.: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J. ACM 51(3), 385\u2013463 (2004)","journal-title":"J. ACM"},{"key":"16_CR21","unstructured":"Szyku\u0142a, M.: Improving the upper bound the length of the shortest reset words. In: 35th International Symposium on Theoretical Aspects of Computer Science (2018)"},{"key":"16_CR22","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 Cas. SAV 14, 208\u2013216 (1964)","journal-title":"Matematicko-fysikalny Cas. SAV"},{"key":"16_CR23","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). \n                    https:\/\/doi.org\/10.1007\/978-3-540-88282-4_4"}],"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-319-98654-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T19:12:02Z","timestamp":1535915522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}