Ilkka Törmä - RankMe

70 papers A* 1B 1C 6Journal 48Unranked 14

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	On countable SFT covers of sparse multidimensional shift spaces. Theor. Comput. Sci. Ilkka Törmä
2025	J	`jnl`	A Three-Dimensional SFT with Sparse Columns. CoRR Ville Salo, Ilkka Törmä
2025	C	`conf`	Multidimensional Tilings and MSO Logic. CiE Rémi Pallen, Ilkka Törmä
2025	J	`jnl`	Multidimensional tilings and MSO logic. CoRR Rémi Pallen, Ilkka Törmä
2025	J	`jnl`	Structure and computability of preimages in the Game of Life. Theor. Comput. Sci. Ville Salo, Ilkka Törmä
2025	—	`conf`	Symbol Frequencies in Surjective Cellular Automata. AUTOMATA Benjamin Hellouin de Menibus, Ville Salo, Ilkka Törmä
2024	J	`jnl`	A Class of Countably Covered Two-Dimensional Sofic Shifts. CoRR Ilkka Törmä
2024	J	`jnl`	Finding Codes on Infinite Grids Automatically. Fundam. Informaticae Ville Salo, Ilkka Törmä
2023	J	`jnl`	A physically universal Turing machine. J. Comput. Syst. Sci. Ville Salo, Ilkka Törmä
2023	J	`jnl`	Arithmetical complexity of the language of generic limit sets of cellular automata. J. Comput. Syst. Sci. Solène J. Esnay, Alonso Núñez, Ilkka Törmä
2023	J	`jnl`	Computing backwards with Game of Life, part 1: wires and circuits. CoRR Ville Salo, Ilkka Törmä
2023	—	`conf`	Diddy: A Python Toolbox for Infinite Discrete Dynamical Systems. AUTOMATA Ville Salo, Ilkka Törmä
2023	J	`jnl`	Diddy: a Python toolbox for infinite discrete dynamical systems. CoRR Ville Salo, Ilkka Törmä
2023	J	`jnl`	Finding codes on infinite grids automatically. CoRR Ville Salo, Ilkka Törmä
2023	J	`jnl`	Limit dynamics of elementary cellular automaton 18. CoRR Hervé Sabrié, Ilkka Törmä
2023	J	`jnl`	Winning Sets of Regular Languages: Descriptional and Computational Complexity. J. Autom. Lang. Comb. Pierre Marcus, Ilkka Törmä
2022	J	`jnl`	Arithmetical Complexity of the Language of Generic Limit Sets of Cellular Automata. CoRR Solène J. Esnay, Alonso Núñez, Ilkka Törmä
2022	J	`jnl`	Cellular automata and bootstrap percolation. Theor. Comput. Sci. Ville Salo, Guillaume Theyssier, Ilkka Törmä
2022	—	`conf`	Gardens of Eden in the Game of Life. Automata and Complexity Ville Salo, Ilkka Törmä
2022	J	`jnl`	Stable Multi-Level Monotonic Eroders. Theory Comput. Syst. Péter Gács, Ilkka Törmä
2022	A*	`conf`	What Can Oracles Teach Us About the Ultimate Fate of Life? ICALP Ville Salo, Ilkka Törmä
2021	J	`jnl`	Bootstrap Percolation and Cellular Automata. CoRR Ville Salo, Guillaume Theyssier, Ilkka Törmä
2021	—	`conf`	Fixed Point Constructions in Tilings and Cellular Automata (Invited Talk). AUTOMATA Ilkka Törmä
2021	J	`jnl`	Fixed Point Constructions in Tilings and Cellular Automata. CoRR Ilkka Törmä
2021	J	`jnl`	Generically Nilpotent Cellular Automata. CoRR Ilkka Törmä
2021	J	`jnl`	Nilpotent endomorphisms of expansive group actions. Int. J. Algebra Comput. Ville Salo, Ilkka Törmä
2021	J	`jnl`	Winning Sets of Regular Languages: Descriptional and Computational Complexity. CoRR Pierre Marcus, Ilkka Törmä
2020	J	`jnl`	A Physically Universal Turing Machine. CoRR Ville Salo, Ilkka Törmä
2020	—	`conf`	Complexity of Generic Limit Sets of Cellular Automata. Automata Ilkka Törmä
2020	J	`jnl`	Countable Sofic Shifts with a Periodic Direction. Theory Comput. Syst. Ilkka Törmä
2020	—	`conf`	Descriptional Complexity of Winning Sets of Regular Languages. DCFS Pierre Marcus, Ilkka Törmä
2020	J	`jnl`	Descriptional Complexity of Winning Sets of Regular Languages. CoRR Pierre Marcus, Ilkka Törmä
2019	J	`jnl`	Gardens of Eden in the Game of Life. CoRR Ville Salo, Ilkka Törmä
2018	J	`jnl`	Cantor-Bendixson ranks of countable SFTs. CoRR Ilkka Törmä
2018	J	`jnl`	Stable Multi-Level Monotonic Eroders. CoRR Péter Gács, Ilkka Törmä
2017	C	`conf`	A One-Dimensional Physically Universal Cellular Automaton. CiE Ville Salo, Ilkka Törmä
2017	J	`jnl`	Independent finite automata on Cayley graphs. Nat. Comput. Ville Salo, Ilkka Törmä
2016	J	`jnl`	PSPACE-completeness of majority automata networks. Theor. Comput. Sci. Eric Goles, Pedro Montealegre, Ville Salo, Ilkka Törmä
2015	J	`jnl`	A One-Dimensional Physically Universal Cellular Automaton. CoRR Ville Salo, Ilkka Törmä
2015	J	`jnl`	A uniquely ergodic cellular automaton. J. Comput. Syst. Sci. Ilkka Törmä
2015	J	`jnl`	Category theory of symbolic dynamics. Theor. Comput. Sci. Ville Salo, Ilkka Törmä
2015	J	`jnl`	Factor Colorings of Linearly Recurrent Words. CoRR Ville Salo, Ilkka Törmä
2015	—	`conf`	Group-Walking Automata. Automata Ville Salo, Ilkka Törmä
2015	J	`jnl`	PSPACE-Completeness of Majority Automata Networks. CoRR Eric Goles Ch., Pedro Montealegre, Ville Salo, Ilkka Törmä
2014	J	`jnl`	Color Blind Cellular Automata. J. Cell. Autom. Ville Salo, Ilkka Törmä
2014	—	`conf`	Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2. Automata Ville Salo, Ilkka Törmä
2014	J	`jnl`	Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2. CoRR Ville Salo, Ilkka Törmä
2014	—	`conf`	Plane-Walking Automata. Automata Ville Salo, Ilkka Törmä
2014	J	`jnl`	Plane-Walking Automata. CoRR Ville Salo, Ilkka Törmä
2014	J	`jnl`	Playing with Subshifts. Fundam. Informaticae Ville Salo, Ilkka Törmä
2014	J	`jnl`	Quantifier Extensions of Multidimensional Sofic Shifts. CoRR Ilkka Törmä
2014	—	`conf`	Subshifts, MSO Logic, and Collapsing Hierarchies. IFIP TCS Ilkka Törmä
2014	J	`jnl`	Subshifts, MSO Logic, and Collapsing Hierarchies. CoRR Ilkka Törmä
2014	C	`conf`	Trace Complexity of Chaotic Reversible Cellular Automata. RC Jarkko Kari, Ville Salo, Ilkka Törmä
2014	J	`jnl`	Trace Complexity of Chaotic Reversible Cellular Automata. CoRR Jarkko Kari, Ville Salo, Ilkka Törmä
2013	J	`jnl`	A Uniquely Ergodic Cellular Automaton. CoRR Ilkka Törmä
2013	J	`jnl`	Block Maps between Primitive Uniform and Pisot Substitutions. CoRR Ville Salo, Ilkka Törmä
2013	—	`conf`	Color Blind Cellular Automata. Automata Ville Salo, Ilkka Törmä
2013	—	`conf`	Commutators of Bipermutive and Affine Cellular Automata. Automata Ville Salo, Ilkka Törmä
2013	J	`jnl`	Constructions with Countable Subshifts of Finite Type. CoRR Ville Salo, Ilkka Törmä
2013	J	`jnl`	Constructions with Countable Subshifts of Finite Type. Fundam. Informaticae Ville Salo, Ilkka Törmä
2013	J	`jnl`	Playing with Subshifts. CoRR Ville Salo, Ilkka Törmä
2012	B	`conf`	Computational Aspects of Cellular Automata on Countable Sofic Shifts. MFCS Ville Salo, Ilkka Törmä
2012	J	`jnl`	Geometry and Dynamics of the Besicovitch and Weyl Spaces CoRR Ville Salo, Ilkka Törmä
2012	C	`conf`	Geometry and Dynamics of the Besicovitch and Weyl Spaces. Developments in Language Theory Ville Salo, Ilkka Törmä
2012	—	`conf`	On Derivatives and Subpattern Orders of Countable Subshifts AUTOMATA & JAC Ville Salo, Ilkka Törmä
2012	C	`conf`	On Shift Spaces with Algebraic Structure. CiE Ville Salo, Ilkka Törmä
2012	J	`jnl`	On Shift Spaces with Algebraic Structure. CoRR Ville Salo, Ilkka Törmä
2012	C	`conf`	On Stable and Unstable Limit Sets of Finite Families of Cellular Automata. LATA Ville Salo, Ilkka Törmä
2012	—	`conf`	Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology AUTOMATA & JAC Ville Salo, Ilkka Törmä