Sign in

On subshifts with slow forbidden word growth

By Ronnie Pavlov
In this work, we treat subshifts, defined in terms of an alphabet AA and (usually infinite) forbidden list FF, where the number of nn-letter words in FF has "slow growth rate" in nn. We show that such subshifts are well-behaved in several ways; for instance, they are boundedly supermultiplicative as... Show more
December 13, 2019
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
On subshifts with slow forbidden word growth
Click on play to start listening