Linearly recurrent subshifts have a finite number of non-periodic subshift factors
Durand, Fabien
HAL, hal-00306716 / Harvested from HAL
Text on HAL
A minimal subshift $(X,T)$ is linearly recurrent if there exists a constant $K$ so that for each clopen set $U$ generated by a finite word $u$ the return time to $U$, with respect to $T$, is bounded by $K|u|$. We prove that given a linearly recurrent subshift $(X,T)$ the set of its non-periodic subshift factors is finite up to isomorphism. We also give a constructive characterization of these subshifts.
Publié le : 2000-09-28
Classification:  linearly recurrent subshift,  37B10,  [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS] 
@article{hal-00306716,
     author = {Durand, Fabien},
     title = {Linearly recurrent subshifts have a finite number of non-periodic subshift factors},
     journal = {HAL},
     volume = {2000},
     number = {0},
     year = {2000},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00306716}
}

Durand, Fabien. Linearly recurrent subshifts have a finite number of non-periodic subshift factors. HAL, Tome 2000 (2000) no. 0, . http://gdmltest.u-ga.fr/item/hal-00306716/