{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:31:20Z","timestamp":1725492680334},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404316"},{"type":"electronic","value":"9783540450054"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45005-x_23","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:27:47Z","timestamp":1192782467000},"page":"270-282","source":"Crossref","is-referenced-by-count":7,"title":["An Inverse Automata Algorithm for Recognizing 2-Collapsing Words"],"prefix":"10.1007","author":[{"given":"Dmitry S.","family":"Ananichev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandra","family":"Cherubini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail V.","family":"Volkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"D. S. Ananichev, A. Cherubini, and M. V. Volkov. Image reducing words and subgroups of free groups. Theor. Comput. Sci., (to appear).","key":"23_CR1","DOI":"10.1016\/S0304-3975(03)00093-8"},{"key":"23_CR2","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-46011-X_13","volume-title":"Developments in Language Theory","author":"D. S. Ananichev","year":"2002","unstructured":"D. S. Ananichev and M. V. Volkov. Collapsing words vs. synchronizing words. In W. Kuich, G. Rozenberg, A. Salomaa (eds.), Developments in Language Theory [Lect. Notes Comput. Sci.\n                           2295], Springer-Verlag, Berlin-Heidelberg-N.Y., 2002, 166\u2013174."},{"key":"23_CR3","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"J. \u010cern\u00fd. Pozn\u00e1mka k homog\u00e9nnym eksperimentom s konecn\u00fdmi avtomatami. Mat.-Fyz. Cas. Slovensk. Akad. Vied.\n                           14 (1964) 208\u2013216 [in Slovak].","journal-title":"Mat.-Fyz. Cas. Slovensk. Akad. Vied."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1006\/jabr.2001.9033","volume":"248","author":"I. Kapovich","year":"2002","unstructured":"I. Kapovich and A. Myasnikov. Stallings foldings and subgroups of free groups, J. Algebra\n                           248 (2002) 608\u2013668.","journal-title":"J. Algebra"},{"key":"23_CR5","first-page":"146","volume":"73","author":"J. Kari","year":"2001","unstructured":"J. Kari. A counter example to a conjecture concerning synchronizing words in finite automata. EATCS Bull. 73 (2001) 146.","journal-title":"EATCS Bull"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1142\/S021819679300007X","volume":"3","author":"S. Margolis","year":"1993","unstructured":"S. Margolis and J. Meakin. Free inverse monoids and graph immersions. Internat. J. Algebra and Computation\n                           3 (1993) 79\u201399.","journal-title":"Internat. J. Algebra and Computation"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-642-59136-5_4","volume-title":"Handbook of Formal Languages","author":"A. Mateesku","year":"1997","unstructured":"A. Mateesku and A. Salomaa. Aspects of classical language theory. In G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages, Vol. I. Word. Language, Grammar, Springer-Verlag, Berlin-Heidelberg-N.Y., 1997, 175\u2013251."},{"doi-asserted-by":"crossref","unstructured":"S. Margolis, J.-E. Pin, and M. V. Volkov. Words guaranteeing minimal image. In M. Ito (ed.), Proc. III Internat. Colloq. on Words, Languages and Combinatorics, World Scientific, Singapore, 2003(to appear).","key":"23_CR8","DOI":"10.1142\/9789812704979_0023"},{"unstructured":"J.-E. Pin. Le Probl\u00e8me de la Synchronisation. Contribution \u00e0 l'\u00c9tude de la Conjecture de \u010cern\u00fd, Th\u00e8se de 3\u00e9me cycle, Paris, 1978 [in French].","key":"23_CR9"},{"key":"23_CR10","first-page":"283","volume":"14","author":"J.-E. Pin","year":"1978","unstructured":"J.-E. Pin. Sur les mots synchronisants dans un automate fini. Elektronische Informationverarbeitung und Kybernetik\n                           14 (1978) 283\u2013289 [in French].","journal-title":"Elektronische Informationverarbeitung und Kybernetik"},{"key":"23_CR11","first-page":"171","volume":"31","author":"N. Sauer","year":"1991","unstructured":"N. Sauer and M. G. Stone. Composing functions to reduce image size. Ars Combinatoria\n                           31 (1991) 171\u2013176.","journal-title":"Ars Combinatoria"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF02095993","volume":"71","author":"J. Stallings","year":"1971","unstructured":"J. Stallings. Topology of finite graphs. Inv. Math.\n                           71 (1971) 551\u2013565.","journal-title":"Inv. Math."}],"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-45005-X_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T09:07:49Z","timestamp":1550999269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45005-X_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404316","9783540450054"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45005-x_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}