{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:42Z","timestamp":1725543462471},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354284"},{"type":"electronic","value":"9783540354307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_39","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T05:55:49Z","timestamp":1150869349000},"page":"433-442","source":"Crossref","is-referenced-by-count":4,"title":["Synchronizing Automata with a Letter of Deficiency 2"],"prefix":"10.1007","author":[{"given":"D. S.","family":"Ananichev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. V.","family":"Volkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu. I.","family":"Zaks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","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, 3\u201313 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"39_CR2","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym eksperimentom s konecn\u00fdmi automatami (in Slovak). Mat.-Fyz. Cas. Slovensk. Akad. Vied.\u00a014, 208\u2013216 (1964)","journal-title":"Mat.-Fyz. Cas. Slovensk. Akad. Vied."},{"key":"39_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1998321-300211","volume":"32","author":"L. Dubuc","year":"1998","unstructured":"Dubuc, L.: Sur le automates circulaires et la conjecture de \u010cern\u00fd (in French). RAIRO Inform. Theor. Appl.\u00a032, 21\u201334 (1998)","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"39_CR4","doi-asserted-by":"publisher","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.\u00a019, 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"key":"39_CR5","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":"39_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF02573120","volume":"37","author":"P.M. Higgins","year":"1988","unstructured":"Higgins, P.M.: The range order of a product of i transformations from a finite full transformation semigroup. Semigroup Forum\u00a037, 31\u201336 (1988)","journal-title":"Semigroup Forum"},{"key":"39_CR7","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":"39_CR8","first-page":"134","volume":"68","author":"A. Mateescu","year":"1999","unstructured":"Mateescu, A., Salomaa, A.: Many-valued truth functions, \u010cern\u00fd\u2019s conjecture and road coloring. EATCS Bull.\u00a068, 134\u2013150 (1999)","journal-title":"EATCS Bull."},{"key":"39_CR9","unstructured":"Pin, J.-E.: Le probl\u00e9me de la synchronisation et la conjecture de \u010cern\u00fd (in French). In: De Luca, A. (ed.) Non-commutative Structures in Algebra and Geometric Combinatorics, CNR, Roma. Quaderni de la Ricerca Scientifica, vol.\u00a0109, pp. 37\u201348 (1981)"},{"key":"39_CR10","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.\u00a017, 535\u2013548 (1983)","journal-title":"Ann. Discrete Math."},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(01)00227-4","volume":"292","author":"A. Salomaa","year":"2003","unstructured":"Salomaa, A.: Composition sequences for functions over a finite domain. Theoret. Comput. Sci.\u00a0292, 263\u2013281 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"39_CR12","unstructured":"Trahtman, A.N.: The \u010cern\u00fd conjecture for aperiodic automata. J. Automata, Languages and Combinatorics (accepted)"},{"key":"39_CR13","unstructured":"Trahtman, A.N.: Noticeable trends and some examples concerning the \u010cern\u00fd conjecture (unpublished manuscript)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:56Z","timestamp":1619507756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11779148_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}