{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:15:28Z","timestamp":1742962528977,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_19","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"240-251","source":"Crossref","is-referenced-by-count":5,"title":["The Synchronization Problem for Strongly Transitive Automata"],"prefix":"10.1007","author":[{"given":"Arturo","family":"Carpi","sequence":"first","affiliation":[]},{"given":"Flavio","family":"D\u2019Alessandro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"B\u00e9al, M.-P.: A note on \u010cern\u00fd\u2019s Conjecture and rational series, technical report, Institut Gaspard Monge, Universit\u00e9 de Marne-la-Vall\u00e9e (2003)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e9al, M.-P., Ceizler, E., Kari, J., Perrin, D.: Unambiguous automata. Math. comput. sci., 14 (2008)","DOI":"10.1007\/s11786-007-0027-1"},{"key":"19_CR3","volume-title":"Rational series and their languages","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational series and their languages. Springer, Heidelberg (1988)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0304-3975(88)90114-4","volume":"60","author":"A. Carpi","year":"1988","unstructured":"Carpi, A.: On synchronizing unambiguous automata. Theoret. comput. sci.\u00a060, 285\u2013296 (1988)","journal-title":"Theoret. comput. sci."},{"key":"19_CR5","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J., Pozn\u00e1mka, K.: Homog\u00e9nnym experimenton s kone\u010dn\u00fdmi automatmi. Mat. fyz. cas SAV\u00a014, 208\u2013215 (1964)","journal-title":"Mat. fyz. cas SAV"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/978-3-662-21545-6_26","volume-title":"Automata, Languages and Programming","author":"Y. C\u00e9sari","year":"1974","unstructured":"C\u00e9sari, Y.: Sur l\u2019application du th\u00e9or\u00e8me de Suschewitsch \u00e0 l\u2019\u00e9tude des codes rationnels complets. In: Loeckx, J. (ed.) Automata, Languages and Programming. LNCS, vol.\u00a014, pp. 342\u2013350. Springer, Berlin (1974)"},{"key":"19_CR7","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 Cerny. RAIRO Inform. Th\u00e9or. Appl.\u00a032, 21\u201334 (1998)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"19_CR8","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press, London (1974)"},{"key":"19_CR9","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.\u00a03, 125\u2013127 (1982)","journal-title":"Eur. J. Comb."},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1051\/ita\/1982160403651","volume":"16","author":"P. Goral\u010d\u00edk","year":"1982","unstructured":"Goral\u010d\u00edk, P., Hedrl\u00edn, Z., Koubek, V., Ry\u0161linkov\u00e1, J.: A game of composing binary relations. RAIRO Inform. Th\u00e9or.\u00a016, 365\u2013369 (1982)","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(02)00405-X","volume":"295","author":"J. Kari","year":"2003","unstructured":"Kari, J.: Synchronizing finite automata on Eulerian digraphs. Theoret. comput. sci.\u00a0295, 223\u2013232 (2003)","journal-title":"Theoret. comput. sci."},{"key":"19_CR12","first-page":"134","volume":"68","author":"A. Mateescu","year":"1999","unstructured":"Mateescu, A., Salomaa, A.: Many-valued truth functions, Cerny\u2019s conjecture and road coloring. EATCS Bull.\u00a068, 134\u2013150 (1999)","journal-title":"EATCS Bull."},{"key":"19_CR13","unstructured":"Pin, J.E.: Le probl\u00e8me de la synchronization et la conjecture de Cerny, Th\u00e8se de 3 \u00e8me cycle, Universit\u00e9 de Paris 6 (1978)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/3-540-08860-1_25","volume-title":"Automata, Languages and Programming","author":"J.E. Pin","year":"1978","unstructured":"Pin, J.E.: Sur un cas particulier de la conjecture de Cerny. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol.\u00a062, pp. 345\u2013352. Springer, Heidelberg (1978)"},{"issue":"5","key":"19_CR15","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/BF02366314","volume":"31","author":"I. Rystov","year":"1995","unstructured":"Rystov, I.: Almost optimal bound of recurrent word length for regular automata. Cybern. Syst. Anal.\u00a031(5), 669\u2013674 (1995)","journal-title":"Cybern. Syst. Anal."},{"key":"19_CR16","first-page":"3","volume":"9","author":"A.N. Trahtman","year":"2007","unstructured":"Trahtman, A.N.: The Cerny conjecture for aperiodic automata. Discrete Math. Theor. Comput. Sci.\u00a09, 3\u201310 (2007)","journal-title":"Discrete Math. Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T18:58:50Z","timestamp":1676055530000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}