An Inequality for the Number of Periods in a Word

DOI10.1142/s0129054121410094zbMath1522.68441arXiv2005.11718OpenAlexW3173755897MaRDI QIDQ6169892

Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit

Publication date: 15 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

periodicitycharacteristic Sturmian wordinitial critical exponentlazy Ostrowski representationperiods of a word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sturmian graphs and integer representations over numeration systems
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Sturmian numeration systems and decompositions to palindromes
• Local symmetries in the period-doubling sequence
• Decision algorithms for Fibonacci-automatic Words, I: Basic results
• Initial powers of Sturmian sequences
• On extremal properties of the Fibonacci word
• Least Periods of Factors of Infinite Words
• Combinatorics on Words
• Automatic Sequences
• From Christoffel Words to Markoff Numbers
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• On the Number of Unbordered Factors
• Ostrowski Numeration and the Local Period of Sturmian Words
• Uniqueness Theorems for Periodic Functions
• Developments in Language Theory

This page was built for publication: An Inequality for the Number of Periods in a Word