Abelian complexity of Thue-Morse word over a ternary alphabet

DOI10.1007/978-3-319-66396-8_13zbMath1405.68265OpenAlexW2749668370MaRDI QIDQ1678347

Idrissa Kaboré, Boucaré Kientéga

Publication date: 15 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-66396-8_13

zbMATH Keywords

infinite wordfactormorphismabelian complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Related Items (6)

Abelian Complexity and Synchronization ⋮ On the abelian complexity of generalized Thue-Morse sequences ⋮ RECURRENCE FUNCTION OF THE TERNARY THUE-MORSE WORD ⋮ On the boundary sequence of an automatic sequence ⋮ On the additive complexity of a Thue-Morse-like sequence ⋮ On infinite prefix normal words

This page was built for publication: Abelian complexity of Thue-Morse word over a ternary alphabet