On the boundary sequence of an automatic sequence

DOI10.1016/j.disc.2021.112632zbMath1482.11037OpenAlexW3203308477MaRDI QIDQ2237216

Xiao-Tao Lü, Zhi Xiong Wen, Ying-Jun Guo

Publication date: 27 October 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112632

zbMATH Keywords

automatic sequenceabelian complexitygeneralized Cantor sequenceboundary sequence

Mathematics Subject Classification ID

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

Related Items (2)

On extended boundary sequences of morphic and Sturmian words ⋮ Automaticity and Parikh-Collinear Morphisms

Uses Software

• Walnut

Cites Work

• Logic and \(p\)-recognizable sets of integers
• Balances for fixed points of primitive substitutions.
• Abelian complexity of Thue-Morse word over a ternary alphabet
• On the \(k\)-abelian complexity of the Cantor sequence
• The abelian complexity of the paperfolding word
• Additive number theory via automata theory
• On the abelian complexity of the Rudin-Shapiro sequence
• On the abelian complexity of generalized Thue-Morse sequences
• Abelian complexity of minimal subshifts
• Automatic Sequences
• Abelian Complexity and Synchronization
• Circular critical exponents for Thue–Morse factors
• Sequences with minimal block growth
• A More Reasonable Proof of Cobham’s Theorem

This page was built for publication: On the boundary sequence of an automatic sequence