{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:49:49Z","timestamp":1764557389358,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"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-53733-7_18","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T10:39:21Z","timestamp":1487155161000},"page":"249-260","source":"Crossref","is-referenced-by-count":5,"title":["Finding DFAs with Maximal Shortest Synchronizing Word Length"],"prefix":"10.1007","author":[{"given":"Henk","family":"Don","sequence":"first","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,2,16]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1090\/S0002-9947-08-04712-0","volume":"361","author":"J Almeida","year":"2009","unstructured":"Almeida, J., Margolis, S., Steinberg, B., Volkov, M.: Representation theory of finite semigroups, semigroup radicals and formal language theory. Trans. Am. Math. Soc. 361, 1429\u20131461 (2009)","journal-title":"Trans. Am. Math. Soc."},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1142\/S0129054111008039","volume":"22","author":"MP B\u00e9al","year":"2011","unstructured":"B\u00e9al, M.P., Berlinkov, M., Perrin, D.: A quadratic upper bound on the size of a synchronizing word in one-cluster automata. Int. J. Found. Comput. Sci. 22, 277\u2013288 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR3","unstructured":"de Bondt, M.: Personal communication, December 2016"},{"issue":"3","key":"18_CR4","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":"18_CR5","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"},{"issue":"3","key":"18_CR6","doi-asserted-by":"crossref","first-page":"P3.12","DOI":"10.37236\/5616","volume":"23","author":"H Don","year":"2016","unstructured":"Don, H.: The \u010cern\u00fd conjecture and $$1$$ -contracting automata. Electron. J. Comb. 23(3), P3.12 (2016)","journal-title":"Electron. J. Comb."},{"key":"18_CR7","unstructured":"Don, H., Zantema, H.: Finding DFAs with maximal shortest synchronizing word length (2016). http:\/\/arxiv.org\/abs\/1609.06853"},{"key":"18_CR8","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 Inform. Theor. Appl. 32, 21\u201334 (1998)","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"18_CR9","unstructured":"Dutertre, B., de Moura, L.: Yices: an SMT solver. http:\/\/yices.csl.sri.com\/"},{"key":"18_CR10","doi-asserted-by":"crossref","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, 125\u2013127 (1982)","journal-title":"Eur. J. Comb."},{"key":"18_CR11","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."},{"key":"18_CR12","first-page":"535","volume":"17","author":"JE Pin","year":"1983","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. Ann. Discret. Math. 17, 535\u2013548 (1983)","journal-title":"Ann. Discret. Math."},{"issue":"2","key":"18_CR13","first-page":"141","volume":"13","author":"A Roman","year":"2008","unstructured":"Roman, A.: A note on \u010cerny conjecture for automata with 3-letter alphabet. J. Automata Lang. Comb. 13(2), 141\u2013143 (2008)","journal-title":"J. Automata Lang. Comb."},{"key":"18_CR14","first-page":"257","volume":"2","author":"P Starke","year":"1966","unstructured":"Starke, P.: Eine bemerkung \u00fcber homogene experimente. Elektronische Informationverarbeitung und Kybernetik 2, 257\u2013259 (1966)","journal-title":"Elektronische Informationverarbeitung und Kybernetik"},{"issue":"39","key":"18_CR15","doi-asserted-by":"crossref","first-page":"5487","DOI":"10.1016\/j.tcs.2011.06.012","volume":"412","author":"B Steinberg","year":"2011","unstructured":"Steinberg, B.: The \u010cern\u00fd conjecture for one-cluster automata with prime length cycle. Theoret. Comput. Sci. 412(39), 5487\u20135491 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T12:28:59Z","timestamp":1601641739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}