{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:46:45Z","timestamp":1725536805303},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_19","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"211-222","source":"Crossref","is-referenced-by-count":4,"title":["The Synchronization Problem for Locally Strongly Transitive Automata"],"prefix":"10.1007","author":[{"given":"Arturo","family":"Carpi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Flavio","family":"D\u2019Alessandro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02761605","volume":"27","author":"R.L. Adler","year":"1977","unstructured":"Adler, R.L., Goodwyn, L.W., Weiss, B.: Equivalence of topological Markov shifts. Israel J. Math.\u00a027, 49\u201363 (1977)","journal-title":"Israel J. Math."},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.09.006","volume":"330","author":"D.S. Ananichev","year":"2005","unstructured":"Ananichev, D.S., Volkov, M.V.: Synchronizing generalized monotonic automata. Theoret. Comput. Sci.\u00a0330(1), 3\u201313 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR3","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_CR4","doi-asserted-by":"crossref","unstructured":"B\u00e9al, M.-P., Perrin, D.: A quadratic upper bound on the size of a synchronizing word in one-cluster automata. To appear in the proceedings of Developments in Language Theory, DLT 2009, Stuttgart, Germany (2009)","DOI":"10.1007\/978-3-642-02737-6_6"},{"key":"19_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-73235-5","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_CR6","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_CR7","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J., Pozn\u00e1mka, k.: Homog\u00e9nnym eksperimenton s kone\u010dn\u00fdmi automatmi. Mat. Fyz. Cas SAV\u00a014, 208\u2013215 (1964)","journal-title":"Mat. Fyz. Cas SAV"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-85780-8_19","volume-title":"Developments in Language Theory","author":"A. Carpi","year":"2008","unstructured":"Carpi, A., D\u2019Alessandro, F.: The synchronization problem for strongly transitive automata. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 240\u2013251. Springer, Heidelberg (2008)"},{"key":"19_CR9","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_CR10","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_CR11","doi-asserted-by":"publisher","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_CR12","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_CR13","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_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02762860","volume":"39","author":"G.L. O\u2019 Brien","year":"1981","unstructured":"O\u2019 Brien, G.L.: The road coloring problem. Israel J. Math.\u00a039, 145\u2013154 (1981)","journal-title":"Israel J. Math."},{"key":"19_CR15","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_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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_CR17","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."},{"issue":"2","key":"19_CR18","first-page":"3","volume":"9","author":"A.N. Trahtman","year":"2007","unstructured":"Trahtman, A.N.: The Cerny conjecture for aperiodic automata. Discrete Math. and Theor. Comput. Sci.\u00a09(2), 3\u201310 (2007)","journal-title":"Discrete Math. and Theor. Comput. Sci."},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Trahtman, A.N.: The road coloring problem. Israel J. Math. (2008) (to appear)","DOI":"10.1007\/s11856-009-0062-5"},{"key":"19_CR20","unstructured":"Volkov, M.V.: Communication in: Around the \u010cern\u00fd conjecture, International Workshop, University of Wroclaw (Poland) (June 2008)"},{"key":"19_CR21","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)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T20:45:13Z","timestamp":1633812313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}