{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:50:21Z","timestamp":1764557421380},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_8","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T04:37:57Z","timestamp":1500525477000},"page":"122-133","source":"Crossref","is-referenced-by-count":7,"title":["DFAs and PFAs with Long Shortest Synchronizing Word Length"],"prefix":"10.1007","author":[{"given":"Michiel","family":"de Bondt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk","family":"Don","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Zantema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"8_CR1","unstructured":"de Bondt, M., Don, H., Zantema, H.: DFAs and PFAs with long shortest synchronizing word length (2017). \nhttps:\/\/arxiv.org\/abs\/1703.07618"},{"issue":"3","key":"8_CR2","first-page":"208","volume":"14","author":"J \u010cerny","year":"1964","unstructured":"\u010cerny, J.: Pozn\u00e1mka k homog\u00e9nnym experimentom s kone\u010dn\u00fdmi automatmi. Matematicko-fyzik\u00e1lny \u010dasopis, Slovensk. Akad. Vied 14(3), 208\u2013216 (1964)","journal-title":"Matematicko-fyzik\u00e1lny \u010dasopis, Slovensk. Akad. Vied"},{"issue":"4","key":"8_CR3","first-page":"289","volume":"7","author":"J \u010cerny","year":"1971","unstructured":"\u010cerny, J., Piricka, A., Rosenauerova, B.: On directable automata. Kybernetika 7(4), 289\u2013298 (1971)","journal-title":"Kybernetika"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-53733-7_18","volume-title":"Language and Automata Theory and Applications","author":"H Don","year":"2017","unstructured":"Don, H., Zantema, H.: Finding DFAs with maximal shortest synchronizing word length. In: Drewes, F., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2017. LNCS, vol. 10168, pp. 249\u2013260. Springer, Cham (2017). doi:\n10.1007\/978-3-319-53733-7_18"},{"key":"8_CR5","unstructured":"Gerencs\u00e9r, B., Gusev, V.V., Jungers, R.M.: Primitive sets of nonnegative matrices and synchronizing automata (2016). \nhttps:\/\/arxiv.org\/abs\/1602.07556"},{"key":"8_CR6","first-page":"146","volume":"73","author":"J Kari","year":"2001","unstructured":"Kari, J.: A counterexample to a conjecture concerning synchronizing word in finite automata. EATCS Bull. 73, 146\u2013147 (2001)","journal-title":"EATCS Bull."},{"issue":"1","key":"8_CR7","doi-asserted-by":"crossref","first-page":"46","DOI":"10.3103\/S1066369X10010056","volume":"54","author":"PV Martyugin","year":"2010","unstructured":"Martyugin, P.V.: A lower bound for the length of the shortest carefully synchronizing words. Russ. Math. (Iz. VUZ) 54(1), 46\u201354 (2010)","journal-title":"Russ. Math. (Iz. VUZ)"},{"key":"8_CR8","first-page":"535","volume":"17","author":"JE Pin","year":"1983","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math. 17, 535\u2013548 (1983)","journal-title":"Ann. Discrete Math."},{"issue":"2","key":"8_CR9","first-page":"141","volume":"13","author":"A Roman","year":"2008","unstructured":"Roman, A.: A note on \u010cern\u00fd conjecture for automata with 3-letter alphabet. J. Autom. Lang. Comb. 13(2), 141\u2013143 (2008)","journal-title":"J. Autom. Lang. Comb."},{"issue":"2","key":"8_CR10","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/BF01069104","volume":"16","author":"I Rystsov","year":"1980","unstructured":"Rystsov, I.: Asymptotic estimate of the length of a diagnostic word for a finite automaton. Cybernetics 16(2), 194\u2013198 (1980)","journal-title":"Cybernetics"},{"key":"8_CR11","unstructured":"Szyku\u0142a, M.: Improving the upper bound the length of the shortest reset word (2017). \nhttps:\/\/arxiv.org\/abs\/1702.05455"},{"key":"8_CR12","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). doi:\n10.1007\/11821069_68"},{"key":"8_CR13","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). doi:\n10.1007\/978-3-540-88282-4_4"},{"issue":"5","key":"8_CR14","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0129054116500167","volume":"27","author":"V Vorel","year":"2016","unstructured":"Vorel, V.: Subset synchronization and careful synchronization of binary finite automata. Int. J. Found. Comput. Sci. 27(5), 557\u2013578 (2016)","journal-title":"Int. J. Found. Comput. Sci."}],"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-62809-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T04:39:47Z","timestamp":1500525587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}