1 citations · 1 across the 11 of their papers we have counts for
1 paper · 2 filters
Be'eri Greenfeld, Carlos Gustavo Moreira, Efim Zelmanov
We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and gro…