{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:28:58Z","timestamp":1759336138767},"reference-count":32,"publisher":"EDP Sciences","issue":"3-4","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":123,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2019,10,7]]},"published-print":{"date-parts":[[2019,7]]},"abstract":"<jats:p>Complementary symmetric Rote sequences are binary sequences which have factor complexity<jats:italic>C<\/jats:italic>(<jats:italic>n<\/jats:italic>) = 2<jats:italic>n<\/jats:italic>for all integers<jats:italic>n<\/jats:italic>\u2265 1 and whose languages are closed under the exchange of letters. These sequences are intimately linked to Sturmian sequences. Using this connection we investigate the return words and the derived sequences to the prefixes of any complementary symmetric Rote sequence<jats:italic>v<\/jats:italic>which is associated with a standard Sturmian sequence<jats:italic>u<\/jats:italic>. We show that any non-empty prefix of<jats:italic>v<\/jats:italic>has three return words. We prove that any derived sequence of<jats:italic>v<\/jats:italic>is coding of three interval exchange transformation and we determine the parameters of this transformation. We also prove that<jats:bold>v<\/jats:bold>is primitive substitutive if and only if<jats:italic>u<\/jats:italic>is primitive substitutive. Moreover, if the sequence<jats:italic>u<\/jats:italic>is a fixed point of a primitive morphism, then all derived sequences of<jats:italic>v<\/jats:italic>are also fixed by primitive morphisms. In that case we provide an algorithm for finding these fixing morphisms.<\/jats:p>","DOI":"10.1051\/ita\/2019004","type":"journal-article","created":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T08:59:17Z","timestamp":1572598757000},"page":"125-151","source":"Crossref","is-referenced-by-count":2,"title":["Derived sequences of complementary symmetric Rote sequences"],"prefix":"10.1051","volume":"53","author":[{"given":"Kate\u0159ina","family":"Medkov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edita","family":"Pelantov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Vuillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,11,1]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.tcs.2005.03.020","volume":"340","author":"Ara\u00fajo","year":"2005","journal-title":"Theoret. Comput. Sci"},{"key":"R2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.tcs.2016.07.042","volume":"647","author":"Balkov\u00e1","year":"2016","journal-title":"Theoret. Comput. Sci"},{"key":"R3","first-page":"443","volume":"44","author":"Balkov\u00e1","year":"2010","journal-title":"RAIRO: ITA"},{"key":"R4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s00605-008-0001-2","volume":"155","author":"Balkov\u00e1","year":"2008","journal-title":"Monatsh. Math"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Berstel J., Sturmian and Episturmian words, in Algebraic Informatics, edited by Bozapalidis S. and Rahonis G.. Springer, Berlin, Heidelberg (2007) 23\u201347.","DOI":"10.1007\/978-3-540-75414-5_2"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Berstel J. and S\u00e9\u00e9bold P., Sturmian words, in Algebraic Combinatorics on Words, edited by Lothaire M.. Cambridge University Press (2002) 45\u2013110.","DOI":"10.1017\/CBO9781107326019.003"},{"key":"R7","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s00605-014-0721-4","volume":"176","author":"Berth\u00e9","year":"2015","journal-title":"Monatsh. Math"},{"key":"R8","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1017\/etds.2015.74","volume":"37","author":"Berth\u00e9","year":"2017","journal-title":"Ergodic Theory Dyn. Syst"},{"key":"R9","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1142\/S0129054118420017","volume":"29","author":"Berth\u00e9","year":"2018","journal-title":"IJFCS Int. J. Found. Comput. Sci"},{"key":"R10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.endm.2009.07.047","volume":"34","author":"Blondin-Mass\u00e9","year":"2009","journal-title":"Electr. Notes Discrete Math"},{"key":"R11","first-page":"13.2.11","volume":"16","author":"Blondin-Mass\u00e9","year":"2013","journal-title":"J. Int. Sequen"},{"key":"R12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.36045\/bbms\/1105730624","volume":"4","author":"Cassaigne","year":"1997","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"key":"R13","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.tcs.2006.07.009","volume":"362","author":"de Luca","year":"2006","journal-title":"Theoret. Comput. Sci"},{"key":"R14","first-page":"#A7","volume":"18A","author":"Dekking","year":"2018","journal-title":"Electr. J. Int"},{"key":"R15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.tcs.2016.01.008","volume":"658","author":"Dolce","year":"2017","journal-title":"Theoret. Comput. Sci"},{"key":"R16","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0012-365X(97)00029-0","volume":"179","author":"Durand","year":"1998","journal-title":"Discrete Math"},{"key":"R17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s002240000084","volume":"31","author":"Durand","year":"1998","journal-title":"Theory Comput. Syst"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"Ferenczi S. and Monteil T., Infinite Words with Uniform frequencies and invariant measures, in Combinatorics, Automata and Number Theory, edited by Berth\u00e9 V. and Rigo M.. Cambridge University Press (2010) 373\u2013409.","DOI":"10.1017\/CBO9780511777653.008"},{"key":"R19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02893083","volume":"89","author":"Ferenczi","year":"2003","journal-title":"J. Anal. Math"},{"key":"R20","unstructured":"Huang Y.K. and Wen Z.Y., Envelope words and the reflexivity of the return word sequences in the period-doubling sequence. Preprint arXiv:1703.07157v1 (2017)."},{"key":"R21","first-page":"343","volume":"34","author":"Justin","year":"2000","journal-title":"RAIRO: ITA"},{"key":"R22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF01236981","volume":"141","author":"Keane","year":"1975","journal-title":"Math. Zeitsch"},{"key":"R23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.tcs.2018.06.037","volume":"743","author":"Klouda","year":"2018","journal-title":"Theoret. Comput. Sci"},{"key":"R24","unstructured":"Lothaire M., Combinatorics on Words, Vol. 17 of Encyclopaedia of Mathematics and its Applications. Addison-Wesley, Reading, Mass (1983). Reprinted in the Cambridge Mathematical Library, Cambridge University Press, Cambridge, UK (1997)."},{"key":"R25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2371431","volume":"62","author":"Morse","year":"1940","journal-title":"Am. J. Math"},{"key":"R26","first-page":"1009","volume":"168","author":"Oseledec","year":"1966","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"Pelantov\u00e1 E. and Starosta \u0160., Constructions of words rich in palindromes and pseudopalindromes. Discr. Math. Theor. Comput. Sci. 18 (2016).","DOI":"10.46298\/dmtcs.655"},{"key":"R28","doi-asserted-by":"crossref","unstructured":"Queff\u00e9lec M., Substitution dynamical systems \u2013 spectral analysis. Vol. 1294 of Lecture Notes in Math. Springer, Berlin (1987).","DOI":"10.1007\/BFb0081890"},{"key":"R29","doi-asserted-by":"crossref","first-page":"315","DOI":"10.4064\/aa-34-4-315-328","volume":"34","author":"Rauzy","year":"1979","journal-title":"Acta Arith"},{"key":"R30","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1006\/jnth.1994.1012","volume":"46","author":"Rote","year":"1994","journal-title":"J. Number Theory"},{"key":"R31","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1006\/eujc.2000.0444","volume":"22","author":"Vuillon","year":"2001","journal-title":"Eur. J. Combin"},{"key":"R32","first-page":"345","volume":"18","author":"Vuillon","year":"2007","journal-title":"Pure Math. Appl"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2019004\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T05:56:47Z","timestamp":1664776607000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2019004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":32,"journal-issue":{"issue":"3-4"},"alternative-id":["ita180067"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2019004","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}