3 research outputs found
The complexity of tangent words
In a previous paper, we described the set of words that appear in the coding
of smooth (resp. analytic) curves at arbitrary small scale. The aim of this
paper is to compute the complexity of those languages.Comment: In Proceedings WORDS 2011, arXiv:1108.341
Subshifts with sparse traces
We study two-dimensional subshifts whose horizontal trace (also called projective subdynamics) contains only configurations of finite support. Our main result is a classification result for such subshifts satisfying a minimality property. As corollaries, we obtain new proofs for various known results on traces of SFTs, nilpotency, and decidability results for cellular automata and topological full groups. We also construct various (sofic) examples illustrating the concepts