{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:34:37Z","timestamp":1725798877155},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096971"},{"type":"electronic","value":"9783319096988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09698-8_7","type":"book-chapter","created":{"date-parts":[[2014,8,18]],"date-time":"2014-08-18T00:52:51Z","timestamp":1408323171000},"page":"68-75","source":"Crossref","is-referenced-by-count":0,"title":["Synchronizing Automata with Random Inputs"],"prefix":"10.1007","author":[{"given":"Vladimir V.","family":"Gusev","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10958-013-1392-8","volume":"192","author":"D.S. Ananichev","year":"2013","unstructured":"Ananichev, D.S., Gusev, V.V., Volkov, M.V.: Primitive digraphs with large exponents and slowly synchronizing automata. Journal of Mathematical Sciences (US)\u00a0192(3), 263\u2013278 (2013)","journal-title":"Journal of Mathematical Sciences (US)"},{"key":"7_CR2","unstructured":"Berlinkov, M.V.: On the probability of being synchronizable (2013), ArXiv: \n                    \n                      http:\/\/arxiv.org\/abs\/1304.5774"},{"key":"7_CR3","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym eksperimentom s kone\u010dn\u00fdmi automatami. Matematicko-fyzikalny \u010casopis Slovensk. Akad. Vied\u00a014(3), 208\u2013216 (1964) (in Slovak)"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1142\/S0129054113400108","volume":"24","author":"V.V. Gusev","year":"2013","unstructured":"Gusev, V.V.: Lower bounds for the length of reset words in eulerian automata. Int. J. Found. Comput. Sci.\u00a024(2), 251\u2013262 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/100816109","volume":"26","author":"R.M. Jungers","year":"2012","unstructured":"Jungers, R.M.: The synchronizing probability function of an automaton. SIAM J. Discret. Math.\u00a026(1), 177\u2013192 (2012)","journal-title":"SIAM J. Discret. Math."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-38768-5_18","volume-title":"Computing and Combinatorics","author":"A. Kisielewicz","year":"2013","unstructured":"Kisielewicz, A., Kowalski, J., Szyku\u0142a, M.: A Fast Algorithm Finding the Shortest Reset Words. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol.\u00a07936, pp. 182\u2013196. Springer, Heidelberg (2013)"},{"key":"7_CR7","first-page":"535","volume":"17","author":"J.-E. Pin","year":"1983","unstructured":"Pin, J.-E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math.\u00a017, 535\u2013548 (1983)","journal-title":"Ann. Discrete Math."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Privault, N.: Understanding Markov Chains. Springer (2013)","DOI":"10.1007\/978-981-4451-51-2"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/11498490_2","volume-title":"Model-Based Testing of Reactive Systems","author":"S. Sandberg","year":"2005","unstructured":"Sandberg, S.: Homing and synchronizing sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol.\u00a03472, pp. 5\u201333. Springer, Heidelberg (2005)"},{"issue":"4","key":"7_CR10","first-page":"95","volume":"12","author":"E.S. Skvortsov","year":"2010","unstructured":"Skvortsov, E.S., Zaks, Y.: Synchronizing random automata. Discr. Math. and Theor. Comp. Sci.\u00a012(4), 95\u2013108 (2010)","journal-title":"Discr. Math. and Theor. Comp. Sci."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-22256-6_27","volume-title":"Implementation and Application of Automata","author":"E. Skvortsov","year":"2011","unstructured":"Skvortsov, E., Tipikin, E.: Experimental study of the shortest reset word of random automata. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol.\u00a06807, pp. 290\u2013298. Springer, Heidelberg (2011)"},{"key":"7_CR12","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":"M.V. 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.\u00a05196, pp. 11\u201327. Springer, Heidelberg (2008)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"2992","DOI":"10.1016\/j.tcs.2009.03.021","volume":"410","author":"M.V. Volkov","year":"2009","unstructured":"Volkov, M.V.: Synchronizing automata preserving a chain of partial orders. Theoret. Comput. Sci.\u00a0410, 2992\u20132998 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10958-013-1396-4","volume":"192","author":"Y.I. Zaks","year":"2013","unstructured":"Zaks, Y.I., Skvortsov, E.S.: Synchronizing random automata on a 4-letter alphabet. Journal of Mathematical Sciences\u00a0192(3), 303\u2013306 (2013)","journal-title":"Journal of Mathematical Sciences"}],"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-09698-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:18:29Z","timestamp":1558973909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09698-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096971","9783319096988"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09698-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}