The recurrence function of a random Sturmian word

DOI10.1137/1.9781611974775.10zbMath1430.68259arXiv1610.01479OpenAlexW2529737626MaRDI QIDQ5195041

Pablo Rotondo, Brigitte Vallée

Publication date: 17 September 2019

Published in: 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items

The Brun gcd algorithm in high dimensions is almost always subtractive, Recurrence and Frequencies