Critical exponent of infinite balanced words via the Pell number system
Lists
Only you see this
Abstract
In a recent paper of Rampersad et al., the authors conjectured that the smallest possible critical exponent of an infinite balanced word over a 5-letter alphabet is $3/2$. We prove this result, using a formulation of first-order logic, the Pell number system, and a machine computation based on finite-state automata.
BibTeX
@inproceedings{baranwal2019critical,
author = {Aseem Raj Baranwal and Jeffrey Shallit},
title = {{Critical exponent of infinite balanced words via the Pell number system}},
booktitle = {Words},
year = {2019},
doi = {10.1007/978-3-030-28796-2\_6},
}Loading related content...