{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:17:49Z","timestamp":1759335469640},"reference-count":10,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1986]]},"DOI":"10.1051\/ita\/1986200201571","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T14:54:29Z","timestamp":1486047269000},"page":"157-181","source":"Crossref","is-referenced-by-count":3,"title":["Compl\u00e9ment \u00e0 l'\u00e9tude des suites de Thue-Morse g\u00e9n\u00e9ralis\u00e9es"],"prefix":"10.1051","volume":"20","author":[{"given":"Patrice","family":"S\u00e9\u00e9bold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. \u010cERN\u00dd A., On a class of infinite words with bounded repetitions, R.A.I.R.O. Informatique Th\u00e9orique, vol. 19, (1985), p. 337-349.922388274810578.68058"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. CHRISTOL G., KAMAE T., MEND\u00c8S-FRANCE M. et RAUZY G., Suites alg\u00e9briques, automates et substitutions, Bull. Soc. Math. Fr., vol. 108, 1980, p. 401-419.873816143170472.10035","DOI":"10.24033\/bsmf.1926"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. COBHAM A., Uniform tag sequences, Math. Systems Theory, vol. 6, 1972, p. 164-192.4570110253.02029","DOI":"10.1007\/BF01706087"},{"key":"R4","unstructured":"4. LOTHAIRE M., Combinatorics on words, Addison-Wesley Reading, Massachusetts, 1983.6759530514.20045"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. MORSE M. et HEDLUND G., Unending chess, symbolic dynamics and a problem in semi-groups, Duke Math., J., vol. 11, 1944, p. 1-7.97880063.04115","DOI":"10.1215\/S0012-7094-44-01101-4"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. PANSIOT J. J., The Morse sequence and iterated morphisms, Inf. Process. Letters, vol. 12, 1981, p. 68-70.6132380464.68075","DOI":"10.1016\/0020-0190(81)90004-1"},{"key":"R7","unstructured":"7. S\u00c9\u00c9BOLD P., Morphismes it\u00e9r\u00e9s, mot de Morse et mot de Fibonacci, C.R. Acad. Sc., t. 295, 1982, p. 439-441.6833980506.20027"},{"key":"R8","unstructured":"8. S\u00c9\u00c9BOLD P., Propri\u00e9t\u00e9s combinatoires des mots infinis engendr\u00e9s par certains morphismes, Th\u00e8se 3e cycle, Universit\u00e9 Paris-VII, 1985."},{"key":"R9","unstructured":"9. THUE A., \u00dcber unendliche Zeichenreihen, Norske Vid. Selk. Skr. I. Math. Nat. Kl. Christiania, vol. 7, 1906, p. 1-22.39.0283.01"},{"key":"R10","unstructured":"10. THUE A., \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norske Vid. Selsk. Skr. I. Math. Nat. Kl. Christiania, vol. 1, 1912, p. 1-67.44.0462.0144.0462.01"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1986200201571\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:55:11Z","timestamp":1568786111000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1986200201571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":10,"journal-issue":{"issue":"2"},"alternative-id":["ita1986200201571"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1986200201571","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986]]}}}