{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:38Z","timestamp":1725514418985},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_21","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T07:36:39Z","timestamp":1185089799000},"page":"234-243","source":"Crossref","is-referenced-by-count":1,"title":["Synchronization of Some DFA"],"prefix":"10.1007","author":[{"given":"A. N.","family":"Trahtman","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","first-page":"208","volume":"14","author":"J. \u010cerny","year":"1964","unstructured":"\u010cerny, J.: Poznamka k homogenym eksperimentom s konechnymi automatami. Math.-Fyz. \u010cas.\u00a014, 208\u2013215 (1964)","journal-title":"Math.-Fyz. \u010cas."},{"issue":"1-3","key":"21_CR2","first-page":"21","volume":"32","author":"L. Dubuc","year":"1998","unstructured":"Dubuc, L.: Sur le automates circulaires et la conjecture de \u010cerny, RAIRO Inform. Theor. Appl.\u00a032(1-3), 21\u201334 (1998)","journal-title":"Theor. Appl."},{"key":"21_CR3","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":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44683-4_38","volume-title":"Mathematical Foundations of Computer Science 2001","author":"J. Kari","year":"2001","unstructured":"Kari, J.: Synchronizing finite automata on Eulerian digraphs. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 432\u2013438. Springer, Heidelberg (2001)"},{"key":"21_CR5","first-page":"16","volume":"2","author":"A.A. Kljachko","year":"1987","unstructured":"Kljachko, A.A., Rystsov, I.K., Spivak, M.A.: An extremely combinatorial problem connected with the bound on the length of a recurrent word in an automata. Kybernetika\u00a02, 16\u201325 (1987)","journal-title":"Kybernetika"},{"key":"21_CR6","volume-title":"Semigroups and Combinatorial Applications","author":"G. Lallement","year":"1979","unstructured":"Lallement, G.: Semigroups and Combinatorial Applications. Wiley, Hoboken (1979)"},{"key":"21_CR7","first-page":"535","volume":"17","author":"J.E. Pin","year":"1983","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. Annals of Discrete Mathematics\u00a017, 535\u2013548 (1983)","journal-title":"Annals of Discrete Mathematics"},{"issue":"5","key":"21_CR8","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/BF02366314","volume":"31","author":"I.K. Rystsov","year":"1995","unstructured":"Rystsov, I.K.: Almost optimal bound on recurrent word length for regular automata. Cybernetics and System An.\u00a031(5), 669\u2013674 (1995)","journal-title":"Cybernetics and System An."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(96)00136-3","volume":"172","author":"I.K. Rystsov","year":"1997","unstructured":"Rystsov, I.K.: Reset words for commutative and solvable automata. Theoret. Comput. Sci.\u00a0172, 273\u2013279 (1997)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"21_CR10","first-page":"332","volume":"8","author":"A. Salomaa","year":"2002","unstructured":"Salomaa, A.: Generation of constants and synchronization of finite automata. J. of Univers. Comput. Sci.\u00a08(2), 332\u2013347 (2002)","journal-title":"J. of Univers. Comput. Sci."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Inf. control\u00a08, 190\u2013194 (1965)","journal-title":"Inf. control"},{"key":"21_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":"A.N. 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.\u00a04162, pp. 789\u2013800. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:38:07Z","timestamp":1619501887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_21","relation":{},"subject":[]}}