From the 1 of 1 linked paper with an AI index.
1 paper
Jason Bell, Laindon Burnett, Chris Schulz
The paper establishes upper bounds on the number of distinct frequencies of subwords in right‑infinite words with linear subword complexity, and shows that these bounds can be exce…