{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:17Z","timestamp":1725664157245},"publisher-location":"Berlin, Heidelberg","reference-count":25,"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_67","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:58:37Z","timestamp":1330257517000},"page":"119-130","source":"Crossref","is-referenced-by-count":0,"title":["On the separators on an infinite word generated by a morphism"],"prefix":"10.1007","author":[{"given":"Emmanuelle","family":"Garel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"11_CR1","first-page":"239","volume":"5","author":"J.P. Allouche","year":"1987","unstructured":"J.P. Allouche. Automates Finis en Th\u00e9orie des Nombres. Expo. Math., 5:239\u2013266, 1987.","journal-title":"Expo. Math."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(92)90001-V","volume":"98","author":"J.-P. Allouche","year":"1992","unstructured":"J.-P. Allouche and J. O. Shallit. The ring of k-regular sequences. Theorical Computer Science, 98:163\u2013197, 1992.","journal-title":"Theorical Computer Science"},{"key":"11_CR3","unstructured":"J. Berstel. Fonctions rationnelles et addition. Actes de l'Ecole de Printemps de Th\u00e9orie des Langages, LITP:177\u2013183, 1981."},{"key":"11_CR4","unstructured":"J. Berstel, C. Retenauer. Les s\u00e9ries rationnelles et leurs langages. Masson, 1984."},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M.T. Chen and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theorical Computer Science, 40:31\u201355, 1985.","journal-title":"Theorical Computer Science"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M.T. Chen and J. Seiferas. atBuilding the Minimal DFA for the Set of all Subwords of a Word One-line in Linear Time. Proc. ICALP '84, Springer Verlag, LNCS-172:109\u2013118, 1984.","DOI":"10.1007\/3-540-13345-3_9"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"401","DOI":"10.24033\/bsmf.1926","volume":"108","author":"G. Christol","year":"1980","unstructured":"G. Christol, T. Kamae, M. Mend\u00e9s-France and G. Rauzy. Suites alg\u00e9briques, automates et substitutions. Bull. Soc. Math. France, 108:401\u2013419, 1980.","journal-title":"Bull. Soc. Math. France"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/BF01706087","volume":"6","author":"A. Cobham","year":"1972","unstructured":"A. Cobham. Uniform tag sequences. Mathem. Syst. Theory, 6:164\u2013192, 1972.","journal-title":"Mathem. Syst. Theory"},{"key":"11_CR9","first-page":"31","volume-title":"Combinatorics on words","author":"M. Crochemore","year":"1984","unstructured":"M. Crochemore. Optimal factor transducers, in A. Apostolico and Z. Galil. Combinatorics on words, Springer, Berlin, 31\u201343, 1984."},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","volume":"45","author":"M. Crochemore","year":"1984","unstructured":"M. Crochemore. Transducers and repetitions. Theorical Computer Science, 45:63\u201386, 1984.","journal-title":"Theorical Computer Science"},{"key":"11_CR11","first-page":"2","volume":"3","author":"C. Davis","year":"1982","unstructured":"C. Davis, D. E. Knuth. Number representations and dragon curves. Journal of Recreational Mathematics, 3:2, 1982, April:66\u201381, 1970, 3:3, 1982, on july:133\u2013149, 1970.","journal-title":"Journal of Recreational Mathematics"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/BF03024244","volume":"4","author":"M. Dekking","year":"1982","unstructured":"M. Dekking, M. Mend\u00e9s-France, A. van der Poorten. FOLDS. Math. Intelligencer, 4:130\u2013138, 4:190\u2013195, 1982, Errata in Math. Intelligencer, 5:5, 1983.","journal-title":"Math. Intelligencer"},{"key":"11_CR13","unstructured":"Automata, Languages and Machines. Academic Press, vol A, 1974."},{"key":"11_CR14","first-page":"115","volume":"july","author":"M. Gardner","year":"1967","unstructured":"M. Gardner. An optimal parallel Mathematical Games. Sciences America, july:115\u2013120, 1967.","journal-title":"Sciences America"},{"key":"11_CR15","first-page":"815","volume":"4","author":"M. Mend\u00e8s-France","year":"1983","unstructured":"M. Mend\u00e8s-France. Courbes du dragon par pliage. The Mathematical Intelligencer, 4:815\u2013866, 1983.","journal-title":"The Mathematical Intelligencer"},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0097-3165(89)90002-2","volume":"50","author":"M. Mend\u00e8s-France","year":"1989","unstructured":"M. Mend\u00e8s-France and J.O. Shallit. Wire Bending. Journal of Combinatorial Theory, Srie A, 50:1\u201323, 1989.","journal-title":"Journal of Combinatorial Theory, Srie A"},{"key":"11_CR17","first-page":"143","volume":"109","author":"M. Mend\u00e8s-France","year":"1981","unstructured":"M. Mend\u00e8s-France and G. Tenenbaum. Dimension des courbes planes, papiers pli\u00e9s et suites de Rudin-Shapiro. Bulletin de la SMF, 2, 109:143\u2013268, 1981.","journal-title":"Bulletin de la SMF, 2"},{"key":"11_CR18","unstructured":"F. Mignosi and P. S\u00e9\u00e9bold. If a DOL Language is k-Power Free then it is Circular. Publications de l'universit\u00e9 d'Amiens."},{"key":"11_CR19","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. Puissances de mots et reconnaissabilit\u00e9 des points fixes d'une substitution. Theorical Computer Science, 2, 99:327\u2013334, 1992.","journal-title":"Theorical Computer Science, 2"},{"key":"11_CR20","unstructured":"B. Moss\u00e9. Notions de reconnaissabilit\u00e9 pour les points fixes substitutions et complexit des suites automatiques. Publications du LMD, Luminy, Marseille."},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"M. Queff\u00e9lec. Substitutions Dynamical Systems Spectral Analysis. Springer Verlag, LNM-1294, 1987.","DOI":"10.1007\/BFb0081890"},{"key":"11_CR22","unstructured":"A. Salomaa and M. Soittola. Automata-Theoretic Aspects of Formal Power Series. Springer Verlag, LNM-1294, 1987. Texts and monographs in computer science."},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"J. Shallit. A Generalisation of automatic sequences. Theorical computer Science, Springer Verlag, LNCS-61:1\u201316, 1988.","DOI":"10.1016\/0304-3975(88)90103-X"},{"key":"11_CR24","unstructured":"P. S\u00e9\u00e9bold. Morphismes it\u00e9r\u00e9s, Mot de Morse et Mot de Fibonacci. C. R. Acad. Sc. Paris, 295, 1982."},{"key":"11_CR25","unstructured":"T. Tapsoba. Complexit\u00e9 des suites automatiques, Thesis, Universit\u00e9 d'Aix-Marseille II, 1987. 130"}],"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_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:25:12Z","timestamp":1605630312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}