Repetition Threshold for Binary Automatic Sequences

Autor:	Allouche, J. -P., Rampersad, N., Shallit, J.
Rok vydání:	2024
Předmět:	Mathematics - Combinatorics Computer Science - Discrete Mathematics Computer Science - Formal Languages and Automata Theory
Druh dokumentu:	Working Paper
Popis:	The critical exponent of an infinite word $\bf x$ is the supremum, over all finite nonempty factors $f$, of the exponent of $f$. In this note we show that for all integers $k\geq 2,$ there is a binary infinite $k$-automatic sequence with critical exponent $\leq 7/3$. The same conclusion holds for Fibonacci-automatic and Tribonacci-automatic sequences.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2406.06513 Zobrazit plný text záznamu View this record from Arxiv