Limits of Rauzy graphs of languages with subexponential complexity

Paul-Henry Leemann, Tatiana Nagnibeda, Alexandra Skripchenko +1

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 subexponential comple…