V. Salo

Most-cited papers

Block maps between primitive uniform and Pisot substitutions
V. Salo, Ilkka Törmä
2013Ergodic Theory and Dynamical Systems38 citations Open access
Semantic Scholar
Distributed Testing of Excluded Subgraphs
P. Fraigniaud, I. Rapaport, V. Salo, Ioan Todinca
2016International Symposium on Distributed Computing37 citations Open access
Semantic Scholar
PSPACE-completeness of majority automata networks
E. Goles, Pedro Montealegre, V. Salo, Ilkka Törmä
2015Theoretical Computer Science29 citations Open access
Semantic Scholar
A Survey on Picture-Walking Automata
J. Kari, V. Salo
2011Algebraic Foundations in Computer Science28 citations
Semantic Scholar
Toeplitz subshift whose automorphism group is not finitely generated
V. Salo
201427 citations Open access
Semantic Scholar
The group of reversible turing machines: subgroups, generators, and computability – CORRIGENDUM
S. Barbieri, J. Kari, V. Salo
2016Forum of Mathematics, Sigma25 citations Open access
Semantic Scholar
A note on subgroups of automorphism groups of full shifts
V. Salo
2015Ergodic Theory and Dynamical Systems24 citations Open access
Semantic Scholar
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model
J. Kari, M. Matamala, I. Rapaport, V. Salo
2015Colloquium on Structural Information & Communication Complexity16 citations
Semantic Scholar
A One-Dimensional Physically Universal Cellular Automaton
V. Salo, Ilkka Törmä
2015Conference on Computability in Europe15 citations Open access
Semantic Scholar
On Nilpotency and Asymptotic Nilpotency of Cellular Automata
V. Salo
2012AUTOMATA & JAC15 citations Open access
Semantic Scholar
Transitive action on finite points of a full shift and a finitary Ryan’s theorem
V. Salo
2016Ergodic Theory and Dynamical Systems14 citations Open access
Semantic Scholar
Constructions with Countable Subshifts of Finite Type
V. Salo, Ilkka Törmä
2013Fundamenta Informaticae13 citations Open access
Semantic Scholar
Decidability and universality of quasiminimal subshifts
V. Salo
2014Journal of computer and system sciences (Print)12 citations Open access
Semantic Scholar
Color Blind Cellular Automata
V. Salo, Ilkka Törmä
2013Journal of Cellular Automata12 citations
Semantic Scholar
Computational Aspects of Cellular Automata on Countable Sofic Shifts
V. Salo, Ilkka Törmä
2012International Symposium on Mathematical Foundations of Computer Science12 citations
Semantic Scholar
Universal groups of cellular automata
V. Salo
2018Colloquium Mathematicum11 citations Open access
Semantic Scholar
Distortion in One-Head Machines and Cellular Automata
Pierre Guillon, V. Salo
2017International Workshop on Cellular Automata and Discrete Complex Systems11 citations Open access
Semantic Scholar
Groups and Monoids of Cellular Automata
V. Salo
2015International Workshop on Cellular Automata and Discrete Complex Systems11 citations Open access
Semantic Scholar
Realization problems for nonuniform cellular automata
V. Salo
2014Theoretical Computer Science11 citations Open access
Semantic Scholar
Distortion element in the automorphism group of a full shift
Antonin Callard, V. Salo
2022Ergodic Theory and Dynamical Systems10 citations Open access
Semantic Scholar
Self-simulable groups
S. Barbieri, Mathieu Sablik, V. Salo
202110 citations
Semantic Scholar
Strongly Universal Reversible Gate Sets
Tim Boykett, J. Kari, V. Salo
2016International Workshop on Reversible Computation10 citations Open access
Semantic Scholar
Subshifts with Simple Cellular Automata
V. Salo
201410 citations
Semantic Scholar
Playing with Subshifts
V. Salo, Ilkka Törmä
2013Fundamenta Informaticae10 citations Open access
Semantic Scholar
Simulations and the Lamplighter group
L. Bartholdi, V. Salo
2020Groups, Geometry, and Dynamics9 citations Open access
Semantic Scholar
On pointwise periodicity in tilings, cellular automata, and subshifts
Tom Meyerovitch, V. Salo
2017Groups, Geometry, and Dynamics9 citations Open access
Semantic Scholar
Plane-Walking Automata
V. Salo, Ilkka Törmä
2014International Workshop on Cellular Automata and Discrete Complex Systems9 citations Open access
Semantic Scholar
Category theory of symbolic dynamics
V. Salo, Ilkka Törmä
2013Theoretical Computer Science9 citations Open access
Semantic Scholar
Characterizing asymptotic randomization in abelian cellular automata
B. H. de Menibus, V. Salo, G. Theyssier
2017Ergodic Theory and Dynamical Systems8 citations Open access
Semantic Scholar
Subshifts with sparse traces
V. Salo
2016Studia Mathematica8 citations
Semantic Scholar
Universal gates with wires in a row
V. Salo
2018Journal of Algebraic Combinatorics7 citations Open access
Semantic Scholar
No Tits alternative for cellular automata
V. Salo
2017Groups, Geometry, and Dynamics7 citations Open access
Semantic Scholar
Finite generating sets for reversible gate sets under general conservation laws
Tim Boykett, J. Kari, V. Salo
2016Theoretical Computer Science7 citations Open access
Semantic Scholar
Automorphism groups of random substitution subshifts
R. Fokkink, D. Rust, V. Salo
2022Indagationes mathematicae6 citations Open access
Semantic Scholar
Graph and wreath products in topological full groups of full shifts
V. Salo
20216 citations
Semantic Scholar
When are groups shifts of finite type
V. Salo
20186 citations
Semantic Scholar
On Shift Spaces with Algebraic Structure
V. Salo, Ilkka Törmä
2012Conference on Computability in Europe6 citations
Semantic Scholar
What Can Oracles Teach Us About the Ultimate Fate of Life?
V. Salo, Ilkka Törmä
2022International Colloquium on Automata, Languages and Programming5 citations
Semantic Scholar
Graph and wreath products of cellular automata
V. Salo
2020International journal of algebra and computation5 citations Open access
Semantic Scholar
Entropy pair realization
V. Salo
2019Ergodic Theory and Dynamical Systems5 citations Open access
Semantic Scholar
Nilpotent endomorphisms of expansive group actions
V. Salo, Ilkka Törmä
2018International journal of algebra and computation5 citations Open access
Semantic Scholar
Strict Asymptotic Nilpotency in Cellular Automata
V. Salo
2017International Workshop on Cellular Automata and Discrete Complex Systems5 citations Open access
Semantic Scholar
On winning shifts of marked uniform substitutions
Jarkko Peltomäki, V. Salo
2017RAIRO - Theoretical Informatics and Applications5 citations Open access
Semantic Scholar
Subshifts with sparse projective subdynamics
V. Salo
20165 citations
Semantic Scholar
Group-Walking Automata
V. Salo, Ilkka Törmä
2015International Workshop on Cellular Automata and Discrete Complex Systems5 citations Open access
Semantic Scholar
A Characterization of Cellular Automata Generated by Idempotents on the Full Shift
V. Salo
2012Computer Science Symposium in Russia5 citations Open access
Semantic Scholar
Independent finite automata on Cayley graphs
V. Salo, Ilkka Törmä
2017Natural Computing4 citations Open access
Semantic Scholar
Factor Colorings of Linearly Recurrent Words
V. Salo, Ilkka Törmä
2015arXiv.org4 citations
Semantic Scholar
Commutators of Bipermutive and Affine Cellular Automata
V. Salo, Ilkka Törmä
2013International Workshop on Cellular Automata and Discrete Complex Systems4 citations
Semantic Scholar
Geometry and Dynamics of the Besicovitch and Weyl Spaces
V. Salo, Ilkka Törmä
2012International Conference on Developments in Language Theory4 citations
Semantic Scholar