Some properties of the \(k\)-bonacci words on infinite alphabet

DOI10.37236/9406zbMath1451.68216arXiv1911.12416OpenAlexW3106927214MaRDI QIDQ2200435

Narges Ghareghani, Pouyeh Sharifani, Morteza Mohammad-Noori

Publication date: 21 September 2020

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

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

Mathematics Subject Classification ID

Combinatorics on words (68R15) Sequences (mod (m)) (11B50)

Related Items (3)

Mixing properties and entropy bounds of a family of Pisot random substitutions ⋮ On square factors and critical factors of \(k\)-bonacci words on infinite alphabet ⋮ Kernel words and factorization of the \(k\)-bonacci sequence

Cites Work

• Unnamed Item
• On a combinatorial property of Sturmian words
• Palindromic prefixes and episturmian words
• A combinatorial property of the Fibonacci words
• Episturmian words and episturmian morphisms
• Palindrome complexity.
• More properties of the Fibonacci word on an infinite alphabet
• Some properties of the Tribonacci sequence
• Palindromic complexity of infinite words associated with simple Parry numbers
• Return words in Sturmian and episturmian words
• Sturmian and Episturmian Words
• Episturmian words: a survey
• Symbolic Dynamics II. Sturmian Trajectories
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Some properties of the \(k\)-bonacci words on infinite alphabet