A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences

zbMath1317.68138arXiv1405.3532MaRDI QIDQ2256124

Aline Parreau, Michel Rigo, Élise Vandomme, Eric S. Rowland

Publication date: 19 February 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.3532

zbMATH Keywords

automatic sequences; regular sequences; Thue-Morse word; abelian complexity; period-doubling word

Mathematics Subject Classification ID

68R15: Combinatorics on words

05A05: Permutations, words, matrices

11B85: Automata sequences

Related Items

Abelian combinatorics on words: a survey, Automaticity and Parikh-Collinear Morphisms, On the 2-abelian complexity of the Thue-Morse word, Relations on words, Counting the number of non-zero coefficients in rows of generalized Pascal triangles, On the \(k\)-abelian complexity of the Cantor sequence, On the 2-abelian complexity of generalized Cantor sequences, On growth and fluctuation of \(k\)-abelian complexity, Computing abelian complexity of binary uniform morphic words, On Growth and Fluctuation of k-Abelian Complexity

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a generalization of abelian equivalence and complexity of infinite words
• On factors of synchronized sequences
• On the 2-abelian complexity of the Thue-Morse word
• The ring of \(k\)-regular sequences
• The ring of \(k\)-regular sequences. II.
• The abelian complexity of the paperfolding word
• Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
• Syntactic Complexity of Ultimately Periodic Sets of Integers
• Generalized Parikh mappings and homomorphisms
• Automatic Sequences
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• Uniform tag sequences