{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T15:30:20Z","timestamp":1775403020610,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540434535","type":"print"},{"value":"9783540460114","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46011-x_13","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T22:54:16Z","timestamp":1182207256000},"page":"166-174","source":"Crossref","is-referenced-by-count":9,"title":["Collapsing Words vs. Synchronizing Words"],"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"}]}],"member":"297","published-online":{"date-parts":[[2002,3,19]]},"reference":[{"key":"13_CR1","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym eksperimentom s konecn\u00fdmi avtomatami. Mat.-Fyz. Cas. Slovensk. Akad. Vied. 14 (1964) 208\u2013216 [in Slovak].","journal-title":"Mat.-Fyz. Cas. Slovensk. Akad. Vied."},{"key":"13_CR2","first-page":"289","volume":"7","author":"J. \u010cern\u00fd","year":"1971","unstructured":"\u010cern\u00fd, J., Pirick\u00e1, A., Rosenauerova, B.:Ondirectable automata.Kybernetika (Praha) 7 (1971) 289\u2013298.","journal-title":"Kybernetika"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1051\/ita\/1996300604951","volume":"30","author":"L. Dubuc","year":"1996","unstructured":"Dubuc, L.: Les automates circulaires biases verifient la conjecture de \u010cern\u00fd. RAIRO, Informatique Th\u00e9orique et Applications 30 (1996) 495\u2013505 [in French].","journal-title":"RAIRO, Informatique Th\u00e9orique et Applications"},{"key":"13_CR4","first-page":"209","volume":"2","author":"W. Goehring","year":"1997","unstructured":"Goehring, W.: Minimal initializing word:A contribution to \u010cern\u00fd conjecture. J. Autom. Lang. Comb. 2 (1997) 209\u2013226.","journal-title":"J. Autom. Lang. Comb."},{"key":"13_CR5","first-page":"181","volume":"6","author":"M. Ito","year":"1983","unstructured":"Ito, M., Duske, J.: On cofinal and definite automata. Acta Cybernetica 6 (1983) 181\u2013189.","journal-title":"Acta Cybernetica"},{"key":"13_CR6","first-page":"146","volume":"73","author":"J. Kari","year":"2001","unstructured":"Kari, J.:Acounter example to a conjecture concerning synchronizingwords in finite automata. EATCS Bulletin 73 (2001) 146.","journal-title":"EATCS Bulletin"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Margolis, S., Pin, J.-E., Volkov, M.V.:Words guaranteeing minimal image. Proc. III Internat. Colloq. onWords, Languages and Combinatorics, submitted.","DOI":"10.1142\/9789812704979_0023"},{"key":"13_CR8","unstructured":"Pin, J.-E.: Sur un cas particulier de la conjecture de \u010cern\u00fd. Automata, Languages, Programming; 5th Colloq., Udine 1978, Lect. Notes Comput. Sci. 62 (1978) 345\u2013352 [in French]."},{"key":"13_CR9","unstructured":"Pin, J.-E.: Le Probl\u00e8me de la Synchronisation. Contribution \u00e0 l\u2019\u00c9tude de la Conjecture de \u010cern\u00fd. Th\u00e8se de 3\u00e9me cycle. Paris, 1978 [in French]."},{"key":"13_CR10","first-page":"283","volume":"14","author":"J.-E. Pin","year":"1978","unstructured":"Pin, J.-E.: Sur les mots synchronisants dans un automate fini. Elektronische Informationverarbeitung und Kybernetik 14 (1978) 283\u2013289 [in French].","journal-title":"Elektronische Informationverarbeitung und Kybernetik"},{"key":"13_CR11","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 (1983) 535\u2013548.","journal-title":"Ann. Discrete Math."},{"key":"13_CR12","first-page":"171","volume":"31","author":"N. Sauer","year":"1991","unstructured":"Sauer, N., Stone, M. G.: Composing functions to reduce image size. Ars Combinatoria 31 (1991) 171\u2013176.","journal-title":"Ars Combinatoria"},{"key":"13_CR13","unstructured":"Starke, P. H.: Abstrakte Automaten. Berlin, 1969 [in German]."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46011-X_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T11:14:35Z","timestamp":1550402075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46011-X_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434535","9783540460114"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46011-x_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}