On Shift Spaces with Algebraic Structure. - Ville Salo; Ilkka Törmä (CiE, 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 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)

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)

Subshifts, MSO Logic, and Collapsing Hierarchies. - Ilkka Törmä (IFIP TCS, 2014)

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

Quantifier Extensions of Multidimensional Sofic Shifts. - Ilkka Törmä (CoRR, 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)

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

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

A uniquely ergodic cellular automaton. - Ilkka Törmä (J. Comput. Syst. Sci., 2015)

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

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

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

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

Cantor-Bendixson ranks of countable SFTs. - Ilkka Törmä (CoRR, 2018)

Complexity of Generic Limit Sets of Cellular Automata. - Ilkka Törmä (Automata, 2020)

Descriptional Complexity of Winning Sets of Regular Languages. - Pierre Marcus; Ilkka Törmä (DCFS, 2020)

Countable Sofic Shifts with a Periodic Direction. - Ilkka Törmä (Theory Comput. Syst., 2020)

Fixed Point Constructions in Tilings and Cellular Automata (Invited Talk). - Ilkka Törmä (AUTOMATA, 2021)

Fixed Point Constructions in Tilings and Cellular Automata. - Ilkka Törmä (CoRR, 2021)

Generically Nilpotent Cellular Automata. - Ilkka Törmä (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)

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)

Stable Multi-Level Monotonic Eroders. - Péter Gács; Ilkka Törmä (Theory Comput. Syst., 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)

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

Limit dynamics of elementary cellular automaton 18. - Hervé Sabrié; Ilkka Törmä (CoRR, 2023)

Winning Sets of Regular Languages: Descriptional and Computational Complexity. - Pierre Marcus; Ilkka Törmä (J. Autom. Lang. Comb., 2023)

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

Arithmetical complexity of the language of generic limit sets of cellular automata. - Solène J. Esnay; Alonso Núñez; Ilkka Törmä (J. Comput. Syst. Sci., 2023)

A Class of Countably Covered Two-Dimensional Sofic Shifts. - Ilkka Törmä (CoRR, 2024)

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

Multidimensional Tilings and MSO Logic. - Rémi Pallen; Ilkka Törmä (CiE, 2025)

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