5 citations · 8 across the 3 of their papers we have counts for
3 papers
math.CO2015★ 5 cited
Factor Colorings of Linearly Recurrent Words
Ville Salo, Ilkka Törmä
In this short article, we study factor colorings of aperiodic linearly recurrent infinite words. We show that there always exists a coloring which does not admit a monochromatic fa…
nlin.CG2012★ 1 cited
Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology
Ville Salo, Ilkka Törmä
We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable spa…
cs.CC2012★ 2 cited
On Derivatives and Subpattern Orders of Countable Subshifts
Ville Salo, Ilkka Törmä
We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of t…