Reduced complexities for sequences over finite alphabets

DOI10.5281/ZENODO.18714474MaRDI QIDQ6849789zbMATH OpenFDO

Authors John M. Campbell, James D. Currie, Narad Rampersad

Publication date 5 March 2026

Published in Integers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5281/ZENODO.18714474

Mathematics Subject Classification ID

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

Cites work

• A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
• Abelian complexity of fixed point of morphism 0 012, 1 02, 2 1
• Abelian complexity of Thue-Morse word over a ternary alphabet
• Automatic Sequences
• Enumeration of factors in the Thue-Morse word
• scientific article; zbMATH DE number 1740032 (Why is no real title available?)
• Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms
• On the 2-abelian complexity of the Thue-Morse word
• On the abelian complexity of generalized Thue-Morse sequences
• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• The abelian complexity of the paperfolding word
• The number of factors in a paperfolding sequence
• The summed paperfolding sequence

This page was built for publication: Reduced complexities for sequences over finite alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6849789)