1 paper · 1 filter
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…