A Survey on Picture-Walking Automata. - Jarkko Kari; Ville Salo (Algebraic Foundations in Computer Science, 2011)

On Shift Spaces with Algebraic Structure. - Ville Salo; Ilkka Törmä (CiE, 2012)

A Characterization of Cellular Automata Generated by Idempotents on the Full Shift. - Ville Salo (CSR, 2012)

Geometry and Dynamics of the Besicovitch and Weyl Spaces. - Ville Salo; Ilkka Törmä (Developments in Language Theory, 2012)

On Stable and Unstable Limit Sets of Finite Families of Cellular Automata. - Ville Salo; Ilkka Törmä (LATA, 2012)

Computational Aspects of Cellular Automata on Countable Sofic Shifts. - Ville Salo; Ilkka Törmä (MFCS, 2012)

On Nilpotency and Asymptotic Nilpotency of Cellular Automata. - Ville Salo (AUTOMATA & JAC, 2012)

On Derivatives and Subpattern Orders of Countable Subshifts - Ville Salo; Ilkka Törmä (AUTOMATA & JAC, 2012)

Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology - Ville Salo; Ilkka Törmä (AUTOMATA & JAC, 2012)

Commutators of Bipermutive and Affine Cellular Automata. - Ville Salo; Ilkka Törmä (Automata, 2013)

Hard Asymptotic Sets for One-Dimensional Cellular Automata. - Ville Salo (CoRR, 2013)

Block Maps between Primitive Uniform and Pisot Substitutions. - Ville Salo; Ilkka Törmä (CoRR, 2013)

Constructions with Countable Subshifts of Finite Type. - Ville Salo; Ilkka Törmä (Fundam. Informaticae, 2013)

Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2. - Ville Salo; Ilkka Törmä (Automata, 2014)

Plane-Walking Automata. - Ville Salo; Ilkka Törmä (Automata, 2014)

Trace Complexity of Chaotic Reversible Cellular Automata. - Jarkko Kari; Ville Salo; Ilkka Törmä (RC, 2014)

Playing with Subshifts. - Ville Salo; Ilkka Törmä (Fundam. Informaticae, 2014)

Color Blind Cellular Automata. - Ville Salo; Ilkka Törmä (J. Cell. Autom., 2014)

Realization problems for nonuniform cellular automata. - Ville Salo (Theor. Comput. Sci., 2014)

Groups and Monoids of Cellular Automata. - Ville Salo (Automata, 2015)

Group-Walking Automata. - Ville Salo; Ilkka Törmä (Automata, 2015)

Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. - Jarkko Kari; Martín Matamala; Ivan Rapaport; Ville Salo (SIROCCO, 2015)

Factor Colorings of Linearly Recurrent Words. - Ville Salo; Ilkka Törmä (CoRR, 2015)

Category theory of symbolic dynamics. - Ville Salo; Ilkka Törmä (Theor. Comput. Sci., 2015)

The Group of Reversible Turing Machines. - Sebastián Barbieri; Jarkko Kari; Ville Salo (Automata, 2016)

Strongly Universal Reversible Gate Sets. - Tim Boykett; Jarkko Kari; Ville Salo (RC, 2016)

Distributed Testing of Excluded Subgraphs. - Pierre Fraigniaud; Ivan Rapaport; Ville Salo; Ioan Todinca (DISC, 2016)

PSPACE-completeness of majority automata networks. - Eric Goles 001; Pedro Montealegre 001; Ville Salo; Ilkka Törmä (Theor. Comput. Sci., 2016)

Distortion in One-Head Machines and Cellular Automata. - Pierre Guillon 001; Ville Salo (AUTOMATA, 2017)

Strict Asymptotic Nilpotency in Cellular Automata. - Ville Salo (AUTOMATA, 2017)

A One-Dimensional Physically Universal Cellular Automaton. - Ville Salo; Ilkka Törmä (CiE, 2017)

Characterizing Asymptotic Randomization in Abelian Cellular Automata. - Benjamin Hellouin de Menibus; Ville Salo; Guillaume Theyssier (CoRR, 2017)

Decidability and universality of quasiminimal subshifts. - Ville Salo (J. Comput. Syst. Sci., 2017)

Independent finite automata on Cayley graphs. - Ville Salo; Ilkka Törmä (Nat. Comput., 2017)

Finite generating sets for reversible gate sets under general conservation laws. - Tim Boykett; Jarkko Kari; Ville Salo (Theor. Comput. Sci., 2017)

Universal groups of cellular automata. - Ville Salo (CoRR, 2018)

Universal gates with wires in a row. - Ville Salo (CoRR, 2018)

Alternation diameter of a product object. - Ville Salo (CoRR, 2019)

Minimal subshifts with a language pivot property. - Ville Salo (CoRR, 2019)

On winning shifts of marked uniform substitutions. - Jarkko Peltomäki; Ville Salo (RAIRO Theor. Informatics Appl., 2019)

Four Heads are Better than Three. - Ville Salo (Automata, 2020)

Simulations and the Lamplighter group. - Laurent Bartholdi; Ville Salo (CoRR, 2020)

Conjugacy of reversible cellular automata. - Ville Salo (CoRR, 2020)

Sequentializing cellular automata. - Jarkko Kari; Ville Salo; Thomas Worsch (Nat. Comput., 2020)

Von Neumann Regularity, Split Epicness and Elementary Cellular Automata. - Ville Salo (AUTOMATA, 2021)

Trees in Positive Entropy Subshifts. - Ville Salo (Axioms, 2021)

Sofically presented dynamical systems. - Johan Kopra; Ville Salo (CoRR, 2021)

Bootstrap Percolation and Cellular Automata. - Ville Salo; Guillaume Theyssier; Ilkka Törmä (CoRR, 2021)

Nilpotent endomorphisms of expansive group actions. - Ville Salo; Ilkka Törmä (Int. J. Algebra Comput., 2021)

Triangle Solitaire. - Ville Salo; Juliette Schabanel (AUTOMATA, 2022)

Gardens of Eden in the Game of Life. - Ville Salo; Ilkka Törmä (Automata and Complexity, 2022)

What Can Oracles Teach Us About the Ultimate Fate of Life? - Ville Salo; Ilkka Törmä (ICALP, 2022)

Distortion element in the automorphism group of a full shift. - Antonin Callard; Ville Salo (CoRR, 2022)

Automatic winning shifts. - Jarkko Peltomäki; Ville Salo (Inf. Comput., 2022)

Cutting corners. - Ville Salo (J. Comput. Syst. Sci., 2022)

Cellular automata and bootstrap percolation. - Ville Salo; Guillaume Theyssier; Ilkka Törmä (Theor. Comput. Sci., 2022)

Diddy: A Python Toolbox for Infinite Discrete Dynamical Systems. - Ville Salo; Ilkka Törmä (AUTOMATA, 2023)

The group of reversible Turing machines: subgroups, generators and computability. - Sebastián Barbieri; Jarkko Kari; Ville Salo (CoRR, 2023)

Computing backwards with Game of Life, part 1: wires and circuits. - Ville Salo; Ilkka Törmä (CoRR, 2023)

A physically universal Turing machine. - Ville Salo; Ilkka Törmä (J. Comput. Syst. Sci., 2023)

On von Neumann regularity of cellular automata. - Ville Salo (Nat. Comput., 2023)

Shifts on the lamplighter group. - Laurent Bartholdi; Ville Salo (CoRR, 2024)

Avoshifts. - Ville Salo (CoRR, 2024)

Snakes can be fooled into thinking they live in a tree. - Laurent Bartholdi; Ville Salo (CoRR, 2024)

Finding Codes on Infinite Grids Automatically. - Ville Salo; Ilkka Törmä (Fundam. Informaticae, 2024)

Structure and computability of preimages in the Game of Life. - Ville Salo; Ilkka Törmä (Theor. Comput. Sci., 2025)

Graph and wreath products of cellular automata. - Ville Salo (Int. J. Algebra Comput., 2025)

Word problems and embedding-obstructions in cellular automata groups on groups. - Ville Salo (CoRR, 2025)

Descriptive Complexity of Sensitivity of Cellular Automata. - Tom Favereau; Ville Salo (CoRR, 2025)