On square factors and critical factors of \(k\)-bonacci words on infinite alphabet

DOI10.1016/j.tcs.2021.02.027zbMath1497.68403arXiv1912.05253OpenAlexW3133340576MaRDI QIDQ2661776

Narges Ghareghani, Pouyeh Sharifani

Publication date: 8 April 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

critical exponentsquarecritical factork-bonacci wordswords on infinite alphabet

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• On critical exponents in fixed points of non-erasing morphisms
• A combinatorial property of the Fibonacci words
• Periodicity and the golden ratio
• The index of Sturmian sequences
• Balances for fixed points of primitive substitutions.
• Some properties of the \(k\)-bonacci words on infinite alphabet
• More properties of the Fibonacci word on an infinite alphabet
• Some properties of the Fibonacci sequence on an infinite alphabet
• Some properties of the Tribonacci sequence
• The Critical Exponent is Computable for Automatic Sequences
• On extremal properties of the Fibonacci word
• On Critical exponents in fixed points ofk-uniform binary morphisms
• Three Series for the Generalized Golden Mean
• Episturmian words: a survey
• A simplified Binet formula for k-generalized Fibonacci numbers
• On Sturmian and episturmian words, and related topics
• Fractional powers in Sturmian words

This page was built for publication: On square factors and critical factors of \(k\)-bonacci words on infinite alphabet