{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:10Z","timestamp":1759335910128},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2009,10,10]],"date-time":"2009-10-10T00:00:00Z","timestamp":1255132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s00236-009-0106-7","type":"journal-article","created":{"date-parts":[[2009,10,9]],"date-time":"2009-10-09T16:19:25Z","timestamp":1255105165000},"page":"591-607","source":"Crossref","is-referenced-by-count":13,"title":["Strongly transitive automata and the \u010cern\u00fd conjecture"],"prefix":"10.1007","volume":"46","author":[{"given":"Arturo","family":"Carpi","sequence":"first","affiliation":[]},{"given":"Flavio","family":"D\u2019Alessandro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,10]]},"reference":[{"key":"106_CR1","doi-asserted-by":"crossref","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. 330, 3\u201313 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"106_CR2","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":"106_CR3","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/s11786-007-0027-1","volume":"1","author":"M.P. B\u00e9al","year":"2008","unstructured":"B\u00e9al M.P., Czeizler E., Kari J., Perrin D.: Unambiguous automata. Math. Comput. Sci. 1, 625\u2013638 (2008)","journal-title":"Math. Comput. Sci."},{"key":"106_CR4","doi-asserted-by":"crossref","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, Berlin (1988)"},{"key":"106_CR5","doi-asserted-by":"crossref","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. 60, 285\u2013296 (1988)","journal-title":"Theoret. Comput. Sci."},{"key":"106_CR6","volume-title":"Developments in Language Theory, DLT 2008, Lecture Notes in Computer Science, vol. 5257","author":"A. Carpi","year":"2008","unstructured":"Carpi A., D\u2019Alessandro F.: The synchronization problem for strongly transitive automata. In: Ito, M., Toyama, M. (eds) Developments in Language Theory, DLT 2008, Lecture Notes in Computer Science, vol. 5257, Springer, Berlin (2008)"},{"key":"106_CR7","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 14, 208\u2013215 (1964)","journal-title":"Mat. Fyz. Cas SAV"},{"key":"106_CR8","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/978-3-662-21545-6_26","volume-title":"Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 14","author":"Y. C\u00e9sari","year":"1974","unstructured":"C\u00e9sari Y.: Sur l\u2019application du th\u00e9or\u00e8me de Suschkewitsch \u00e0 l\u2019\u00e9tude des codes rationnels complets. In: Loeckx, J. (eds) Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 14, pp. 342\u2013350. Springer, Berlin (1974)"},{"key":"106_CR9","first-page":"21","volume":"32","author":"L. Dubuc","year":"1998","unstructured":"Dubuc L.: Sur les automates circulaires et la conjecture de Cerny, RAIRO Inform. Th\u00e9or. Appl. 32, 21\u201334 (1998)","journal-title":"Th\u00e9or. Appl."},{"key":"106_CR10","volume-title":"Automata, Languages and Machines, vol. A","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg S.: Automata, Languages and Machines, vol. A. Academic Press, New York (1974)"},{"key":"106_CR11","doi-asserted-by":"crossref","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. 19, 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"key":"106_CR12","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":"106_CR13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1051\/ita\/1982160403651","volume":"16","author":"P. Goral\u010d\u00edk","year":"1982","unstructured":"Goral\u010d P., Hedrl\u00edn Z., Koubek V., Ry\u0161linkov\u00e1 J.: A game of composing binary relations. RAIRO Inform. Th\u00e9or. 16, 365\u2013369 (1982)","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"106_CR14","doi-asserted-by":"crossref","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. 295, 223\u2013232 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"106_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":"106_CR16","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: Sur un cas particulier de la conjecture de Cerny, In: Proceedings of the 5th ICALP. Lecture Notes in Computer Science, vol. 62, pp. 345\u2013352. Springer, Berlin (1978)","DOI":"10.1007\/3-540-08860-1_25"},{"key":"106_CR17","first-page":"535","volume":"17","author":"J.E. 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":"5","key":"106_CR18","doi-asserted-by":"crossref","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. 31(5), 669\u2013674 (1995)","journal-title":"Cybern. Syst. Anal."},{"key":"106_CR19","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. 9, 3\u201310 (2007)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"106_CR20","doi-asserted-by":"crossref","unstructured":"Volkov, M.V.: Synchronizing automata and the \u010cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008, Lecture Notes in Computer Science, vol. 5196, pp. 11\u201327. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-88282-4_4"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0106-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-009-0106-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0106-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T03:20:46Z","timestamp":1685157646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-009-0106-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,10]]},"references-count":20,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["106"],"URL":"https:\/\/doi.org\/10.1007\/s00236-009-0106-7","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,10]]}}}