23 citations · 78 across the 31 of their papers we have counts for
4 papers · 1 filter
On subshifts with slow forbidden word growth
Ronnie Pavlov
In this work, we treat subshifts, defined in terms of an alphabet and (usually infinite) forbidden list , where the number of -letter words in has "slow growth rate"…
On the complexity function for sequences which are not uniformly recurrent
Nic Ormes, Ronnie Pavlov
We prove that every non-minimal transitive subshift satisfying a mild aperiodicity condition satisfies , and give a class of examples which show…
Subsystems of transitive subshifts with linear complexity
Andrew Dykstra, Nicholas Ormes, Ronnie Pavlov
We bound the number of distinct minimal subsystems of a given transitive subshift of linear complexity, continuing work of Ormes and Pavlov [7]. We also bound the number of generic…
The relationship between word complexity and computational complexity in subshifts
Ronnie Pavlov, Pascal Vanier
We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing…