{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:05:56Z","timestamp":1776305156766,"version":"3.50.1"},"reference-count":22,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T00:00:00Z","timestamp":1674000000000},"content-version":"vor","delay-in-days":17,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2022,12,5]]},"published-print":{"date-parts":[[2023]]},"abstract":"<jats:p>We study the properties of the ternary infinite word<\/jats:p>\n<jats:p content-type=\"center\"><jats:bold>p<\/jats:bold> = 012102101021012101021012\u22ef,<\/jats:p>\n<jats:p>that is, the fixed point of the map <jats:italic>h<\/jats:italic> : 0 \u2192 01, 1 \u2192 21, 2 \u2192 0. We determine its factor complexity, critical exponent, and prove that it is 2-balanced. We compute its abelian complexity and determine the lengths of its bispecial factors. Finally, we give a characterization of <jats:bold>p<\/jats:bold> in terms of avoided factors.<\/jats:p>","DOI":"10.1051\/ita\/2022010","type":"journal-article","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T09:03:59Z","timestamp":1674032639000},"page":"1","source":"Crossref","is-referenced-by-count":1,"title":["Properties of a ternary infinite word"],"prefix":"10.1051","volume":"57","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0061-3849","authenticated-orcid":false,"given":"James","family":"Currie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5504-4586","authenticated-orcid":false,"given":"Pascal","family":"Ochem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7489-0980","authenticated-orcid":false,"given":"Narad","family":"Rampersad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1197-3820","authenticated-orcid":false,"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2023,1,18]]},"reference":[{"key":"R1","unstructured":"Berstel J., Axel Thue\u2019s Papers on Repetitions in Words: a Translation. Number 20 in Publications du Laboratoire de Combinatoire et d\u2019Informatique Mathematique. Universite du Quebec a Montreal (February 1995)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0304-3975(96)00260-5","volume":"181","author":"Bruyere","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Cassaigne J., Labbe S. and Leroy J., A set of sequences of complexity 2n + 1. In Brlek S. et al., editors, WORDS 2017, Vol. 10432 of Lecture Notes in Computer Science. Springer-Verlag (2017), pp. 144\u2013156.","DOI":"10.1007\/978-3-319-66396-8_14"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Cassaigne J., Labbe S. and Leroy J., Almost everywhere balanced sequences of complexity 2n + 1. Preprint https:\/\/arxiv.org\/abs\/2102.10093 (2022).","DOI":"10.2140\/moscow.2022.11.287"},{"key":"R5","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01762232","volume":"7","author":"Coven","year":"1973","journal-title":"Math. Systems Theory"},{"key":"R6","unstructured":"Currie J.D., Ochem P., Rampersad N. and Shallit J., Complement avoidance in binary words. Preprint https:\/\/arxiv.org\/abs\/2209.09598 (2022)."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Everest G., van der Poorten A., Shparlinski I. and Ward T., Recurrence Sequences, Vol. 104 of Mathematical Surveys and Monographs. Amer. Math. Soc. (2003).","DOI":"10.1090\/surv\/104"},{"key":"R8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1080\/00029890.1985.11971550","volume":"92","author":"Fraenkel","year":"1985","journal-title":"Am. Math. Monthly"},{"key":"R9","unstructured":"Frougny C. and Solomyak B., On representation of integers in linear numeration systems. In Pollicott M. and Schmidt K., editors, Ergodic Theory of \u2124d Actions (Warwick, 1993-1994), Vol. 228 of London Mathematical Society Lecture Note Series. Cambridge University Press (1996), pp. 345\u2013368."},{"key":"R10","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1051\/ita\/2009003","volume":"43","author":"Glen","year":"2009","journal-title":"RAIRO Inform. Theor. App."},{"key":"R11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(83)90002-1","volume":"5","author":"Karhumaki","year":"1983","journal-title":"Disc. Appl. Math."},{"key":"R12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1051\/ita\/1992260301991","volume":"26","author":"Mignosi","year":"1992","journal-title":"RAIRO Inform. Theor. App."},{"key":"R13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2371431","volume":"62","author":"Morse","year":"1940","journal-title":"Am. J. Math."},{"key":"R14","unstructured":"Mousavi H., Automatic theorem proving in Walnut. Preprint http:\/\/arxiv.org\/abs\/1603.06017 (2016)."},{"key":"R15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1051\/ita\/2016010","volume":"50","author":"Mousavi","year":"2016","journal-title":"RAIRO Inform. Theor. App."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"Mousavi H. and Shallit J., Mechanical proofs of properties of the Tribonacci word. In Manea F. and Nowotka D., editors, Proc. WORDS 2015, Vol. 9304 of Lecture Notes in Computer Science. Springer-Verlag (2015), pp. 1\u201321.","DOI":"10.1007\/978-3-319-23660-5_15"},{"key":"R17","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1112\/jlms\/jdq063","volume":"83","author":"Richomme","year":"2011","journal-title":"J. London Math. Soc."},{"key":"R18","first-page":"#A36","volume":"21","author":"Shallit","year":"2021","journal-title":"INTEGERS \u2014 Elect. J. Comb. Numb. Theory"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Shallit J., Synchronized sequences. In Lecroq T. and Puzynina S., editors, WORDS 2021, Vol. 12847 of Lecture Notes in Computer Science. Springer-Verlag (2021), pp. 1\u201319.","DOI":"10.1007\/978-3-030-85088-3_1"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"Shallit J., The Logical Approach To Automatic Sequences: Exploring Combinatorics on Words with Walnut, Vol. 482 of London Math. Soc. Lecture Note Series. Cambridge University Press (2022).","DOI":"10.1017\/9781108775267"},{"key":"R21","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.tcs.2018.09.010","volume":"792","author":"Shallit","year":"2019","journal-title":"Theoret. Comput. Sci."},{"key":"R22","first-page":"1","volume":"1","author":"Thue","year":"1912","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2022010\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T09:04:20Z","timestamp":1674032660000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2022010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":22,"alternative-id":["ita220038"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2022010","relation":{},"ISSN":["0988-3754","2804-7346"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"2804-7346","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}