Georgii A Veprev

Limits of Rauzy graphs of languages with subexponential complexity

To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of unbounded subexponential complexity, the Rauzy graphs converge in the sense of Benjamini–Schramm if and only if their emp...