{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:12Z","timestamp":1760202612051},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222559"},{"type":"electronic","value":"9783642222566"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22256-6_27","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T17:37:04Z","timestamp":1311010624000},"page":"290-298","source":"Crossref","is-referenced-by-count":13,"title":["Experimental Study of the Shortest Reset Word of Random Automata"],"prefix":"10.1007","author":[{"given":"Evgeny","family":"Skvortsov","sequence":"first","affiliation":[]},{"given":"Evgeny","family":"Tipikin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Ananichev, D.S., Gusev, V.V., Volkov, M.V.: Slowly synchronizing automata and digraphs. In: Hlinen\u00fd and Kucera [13], pp. 55\u201365","DOI":"10.1007\/978-3-642-15155-2_7"},{"issue":"1-2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2007.01.010","volume":"376","author":"D.S. Ananichev","year":"2007","unstructured":"Ananichev, D.S., Volkov, M.V., Zaks, Y.I.: Synchronizing automata with a letter of deficiency. Theor. Comput. Sci.\u00a0376(1-2), 30\u201341 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-13182-0_4","volume-title":"Computer Science \u2013 Theory and Applications","author":"M.V. Berlinkov","year":"2010","unstructured":"Berlinkov, M.V.: Approximating the Minimum Length of Synchronizing Words Is Hard. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol.\u00a06072, pp. 37\u201347. Springer, Heidelberg (2010)"},{"key":"27_CR4","unstructured":"Bulatov, A.A., Skvortsov, E.S.: Phase transition for local search on planted SAT. CoRR, abs\/0811.2546 (2008)"},{"key":"27_CR5","first-page":"208","volume":"14","author":"J. \u010derny","year":"1964","unstructured":"\u010derny, J.: Pozn\u00e1mka k homog\u00e9nnym eksperimentom s kone\u010dn\u00fdmi automatami. Matematicko-fyzikalny \u010casopis Slovensk. Akad. Vied\u00a014, 208\u2013216 (1964)","journal-title":"Akad. Vied"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11758471_9","volume-title":"Algorithms and Complexity","author":"E. Dantsin","year":"2006","unstructured":"Dantsin, E., Hirsch, E.A., Wolpert, A.: Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 60\u201368. Springer, Heidelberg (2006)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective Preprocessing in SAT Through Variable and Clause Elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 61\u201375. Springer, Heidelberg (2005)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"27_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 J. Comput.\u00a019, 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF02573120","volume":"37","author":"P. Higgins","year":"1988","unstructured":"Higgins, P.: The range order of a product of i transformations from a finite full transformation semigroup. Semigroup Forum\u00a037, 31\u201336 (1988), doi:10.1007\/BF02573120","journal-title":"Semigroup Forum"},{"issue":"1\/2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1006318521185","volume":"24","author":"E.A. Hirsch","year":"2000","unstructured":"Hirsch, E.A.: Sat local search algorithms: Worst-case study. J. Autom. Reasoning\u00a024(1\/2), 127\u2013143 (2000)","journal-title":"J. Autom. Reasoning"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Computer Science 2010","year":"2010","unstructured":"Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.): MFCS 2010. LNCS, vol.\u00a06281. Springer, Heidelberg (2010)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Olschewski, J., Ummels, M.: The complexity of finding reset words in finite automata. In: Hlinen\u00fd and Kucera [13], pp. 568\u2013579","DOI":"10.1007\/978-3-642-15155-2_50"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0304-0208(08)73432-7","volume-title":"Proceedings of the International Colloquium on Graph Theory and Combinatorics, Combinatorial Mathematics","author":"J.-E. Pin","year":"1983","unstructured":"Pin, J.-E.: On two combinatorial problems arising from automata theory. In: Berge, C., Bresson, D., Camion, P., Maurras, J.F., Sterboul, F. (eds.) Proceedings of the International Colloquium on Graph Theory and Combinatorics, Combinatorial Mathematics, vol.\u00a075, pp. 535\u2013548. North-Holland, Amsterdam (1983)"},{"key":"27_CR16","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.\u00a05457, pp. 684\u2013695. Springer, Heidelberg (2009)"},{"key":"27_CR17","unstructured":"Evgeny Skvortsov. Google profile, \n                    \n                      http:\/\/profiles.google.com\/u\/0\/108501114510819324139\/about"},{"issue":"4","key":"27_CR18","first-page":"95","volume":"12","author":"E.S. Skvortsov","year":"2010","unstructured":"Skvortsov, E.S., Zaks, Y.: Synchronizing random automata. Discrete Mathematics & Theoretical Computer Science\u00a012(4), 95\u2013108 (2010)","journal-title":"Discrete Mathematics & Theoretical Computer Science"}],"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-642-22256-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T22:20:58Z","timestamp":1554330058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22256-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222559","9783642222566"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22256-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}