{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:16Z","timestamp":1725664156216},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_66","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:58:24Z","timestamp":1330257504000},"page":"107-118","source":"Crossref","is-referenced-by-count":0,"title":["On the subword equivalence problem for infinite words"],"prefix":"10.1007","author":[{"given":"Isabelle","family":"Fagnot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"n\u22183\u20134","key":"10_CR1","first-page":"225","volume":"28","author":"J. Berstel","year":"1994","unstructured":"J. Berstel and P. S\u00e9\u00e9bold, A remark on morphic Sturmian words, Inform. Theor. Appl.\n28, n\u2218 3\u20134, (1994), p. 225\u2013263.","journal-title":"Inform. Theor. Appl."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BF01746527","volume":"3","author":"A. Cobham","year":"1969","unstructured":"A. Cobham, On the base-dependence of sets of numbers recognizable by finite automata, Math. Systems Theory\n3 (1969), p. 186\u2013192.","journal-title":"Math. Systems Theory"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/BF01706087","volume":"6","author":"A. Cobham","year":"1972","unstructured":"A. Cobham, Uniform tag sequences, Math. Systems Theory\n6 (1972), p. 164\u2013192.","journal-title":"Math. Systems Theory"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/S0019-9958(77)90512-5","volume":"35","author":"K. \u010culik II","year":"1977","unstructured":"K. \u010culik II and I. Fris, The decidability of the equivalence problem for DOL-systems, Inform. Control\n35 (1977), p. 20\u201339.","journal-title":"Inform. Control"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1145\/62.2161","volume":"31","author":"K. \u010culik II","year":"1984","unstructured":"K. \u010culik II and T. Harju, The \u03c9-sequence equivalence problem for DOL-systems is decidable, J. Assoc. Comput. Mach., 31 (1984), p. 282\u2013298.","journal-title":"J. Assoc. Comput. Mach."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0021-8693(83)90119-9","volume":"85","author":"A. Ehrenfeucht","year":"1983","unstructured":"A. Ehrenfeucht, J. Karhumaki and G. Rozenberg, On binary equality sets and a solution to the test set conjecture in the binary case, J. Algebra\n85 (1983), p. 76\u201385.","journal-title":"J. Algebra"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0019-9958(83)80028-X","volume":"59","author":"A. Ehrenfeucht","year":"1983","unstructured":"A. Ehrenfeucht and G. Rozenberg, Repetition of subwords in DOL languages, Inform. and Control\n59 (1983), p. 13\u201335.","journal-title":"Inform. and Control"},{"key":"10_CR8","unstructured":"I. Fagnot, Sur le probl\u00e8me de l'\u00e9galit\u00e9 des facteurs dans les mots morphiques, Technical report of L. I. T. P., 94\/63, (1994)."},{"key":"10_CR9","unstructured":"I. Fagnot, Sur les facteurs des mots automatiques, Technical report of L. I. T. P., to appear."},{"key":"10_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9781400855162","volume-title":"Recurrence in ergodic theory and combinatorial number theory","author":"H. Furstenberg","year":"1981","unstructured":"H. Furstenberg, Recurrence in ergodic theory and combinatorial number theory, Princeton Universty Press, Princeton (1981)."},{"key":"10_CR11","series-title":"Greco de Programmation","volume-title":"Actes de la f\u00eate des mots","author":"G. Hansel","year":"1982","unstructured":"G. Hansel, A propos d'un th\u00e9or\u00e8me de Cobham, in: Actes de la f\u00eate des mots, D. Perrin Ed., Greco de Programmation, CNRS, Rouen (1982)"},{"issue":"n\u22181","key":"10_CR12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1051\/ita\/1986200100471","volume":"20","author":"T. Harju","year":"1986","unstructured":"T. Harju and M. Linna, On the periodicity of morphisms on free monoids, Inform. Theor Appl.\n20, n\u2218 1, (1986), p. 47\u201354.","journal-title":"Inform. Theor Appl."},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0304-3975(92)90357-L","volume":"99","author":"B. Moss\u00e9","year":"1992","unstructured":"B. Moss\u00e9, Puissance de mots et reconnaissabilit\u00e9 des points fixes d'une substitution, Theoret. Comput. Sci.\n99 (1992), p. 327\u2013334.","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR14","first-page":"1","volume-title":"Finite automata, dans Handbook of theoretical computer science, Vol. B","author":"D. Perrin","year":"1990","unstructured":"D. Perrin, Finite automata, dans Handbook of theoretical computer science, Vol. B, J. Van Leeuwen Ed., Elsevier, Amsterdam (1990), p. 1\u201357."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"M. Queffelec, Substitution dynamical systems-Spectral analysis, Lecture Notes in Math. 1294 (1987), Springer-Verlag.","DOI":"10.1007\/BFb0081890"},{"key":"10_CR16","first-page":"137","volume":"36","author":"P. S\u00e9\u00e9bold","year":"1988","unstructured":"P. S\u00e9\u00e9bold, An effective solution to the DOL periodicity problem in the binary case, EATCS Bull.\n36 (1988), p. 137\u2013151.","journal-title":"EATCS Bull."},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-55210-3_175","volume":"577","author":"R. Villemaire","year":"1992","unstructured":"R. Villemaire, joining k-and l-recognizable sets of natural numbers, Proc. Stacs'92, Lecture notes in Comput. Sci.\n577 (1992), p. 83\u201394.","journal-title":"Lecture notes in Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:22:11Z","timestamp":1619558531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}