Ville Salo

Orcid: 0000-0002-2059-194X

Affiliations:
  • University of Turku, Finland


According to our database1, Ville Salo authored at least 66 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Finding Codes on Infinite Grids Automatically.
Fundam. Informaticae, 2024

Snakes can be fooled into thinking they live in a tree.
CoRR, 2024

Avoshifts.
CoRR, 2024

Shifts on the lamplighter group.
CoRR, 2024

2023
On von Neumann regularity of cellular automata.
Nat. Comput., September, 2023

A physically universal Turing machine.
J. Comput. Syst. Sci., 2023

Computing backwards with Game of Life, part 1: wires and circuits.
CoRR, 2023

The group of reversible Turing machines: subgroups, generators and computability.
CoRR, 2023

Diddy: A Python Toolbox for Infinite Discrete Dynamical Systems.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2023

2022
Cellular automata and bootstrap percolation.
Theor. Comput. Sci., 2022

Cutting corners.
J. Comput. Syst. Sci., 2022

Automatic winning shifts.
Inf. Comput., 2022

Distortion element in the automorphism group of a full shift.
CoRR, 2022

What Can Oracles Teach Us About the Ultimate Fate of Life?
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Gardens of Eden in the Game of Life.
Proceedings of the Automata and Complexity, 2022

Triangle Solitaire.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2022

2021
Nilpotent endomorphisms of expansive group actions.
Int. J. Algebra Comput., 2021

Bootstrap Percolation and Cellular Automata.
CoRR, 2021

Sofically presented dynamical systems.
CoRR, 2021

Trees in Positive Entropy Subshifts.
Axioms, 2021

Von Neumann Regularity, Split Epicness and Elementary Cellular Automata.
Proceedings of the 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, 2021

2020
Sequentializing cellular automata.
Nat. Comput., 2020

Graph and wreath products of cellular automata.
CoRR, 2020

Conjugacy of reversible cellular automata.
CoRR, 2020

Simulations and the Lamplighter group.
CoRR, 2020

Four Heads are Better than Three.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2020

2019
On winning shifts of marked uniform substitutions.
RAIRO Theor. Informatics Appl., 2019

Minimal subshifts with a language pivot property.
CoRR, 2019

Alternation diameter of a product object.
CoRR, 2019

2018
Universal gates with wires in a row.
CoRR, 2018

Universal groups of cellular automata.
CoRR, 2018

2017
Finite generating sets for reversible gate sets under general conservation laws.
Theor. Comput. Sci., 2017

Independent finite automata on Cayley graphs.
Nat. Comput., 2017

Decidability and universality of quasiminimal subshifts.
J. Comput. Syst. Sci., 2017

Characterizing Asymptotic Randomization in Abelian Cellular Automata.
CoRR, 2017

A One-Dimensional Physically Universal Cellular Automaton.
Proceedings of the Unveiling Dynamics and Complexity, 2017

Strict Asymptotic Nilpotency in Cellular Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2017

Distortion in One-Head Machines and Cellular Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2017

2016
PSPACE-completeness of majority automata networks.
Theor. Comput. Sci., 2016

Distributed Testing of Excluded Subgraphs.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Strongly Universal Reversible Gate Sets.
Proceedings of the Reversible Computation - 8th International Conference, 2016

The Group of Reversible Turing Machines.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2016

2015
Category theory of symbolic dynamics.
Theor. Comput. Sci., 2015

Factor Colorings of Linearly Recurrent Words.
CoRR, 2015

Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model.
Proceedings of the Structural Information and Communication Complexity, 2015

Group-Walking Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2015

Groups and Monoids of Cellular Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2015

2014
Realization problems for nonuniform cellular automata.
Theor. Comput. Sci., 2014

Color Blind Cellular Automata.
J. Cell. Autom., 2014

Playing with Subshifts.
Fundam. Informaticae, 2014

Trace Complexity of Chaotic Reversible Cellular Automata.
Proceedings of the Reversible Computation - 6th International Conference, 2014

Plane-Walking Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

2013
Constructions with Countable Subshifts of Finite Type.
Fundam. Informaticae, 2013

Block Maps between Primitive Uniform and Pisot Substitutions.
CoRR, 2013

Hard Asymptotic Sets for One-Dimensional Cellular Automata.
CoRR, 2013

Commutators of Bipermutive and Affine Cellular Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2013

2012
Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology
Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

On Derivatives and Subpattern Orders of Countable Subshifts
Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

On Nilpotency and Asymptotic Nilpotency of Cellular Automata.
Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

Computational Aspects of Cellular Automata on Countable Sofic Shifts.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

On Stable and Unstable Limit Sets of Finite Families of Cellular Automata.
Proceedings of the Language and Automata Theory and Applications, 2012

Geometry and Dynamics of the Besicovitch and Weyl Spaces.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

A Characterization of Cellular Automata Generated by Idempotents on the Full Shift.
Proceedings of the Computer Science - Theory and Applications, 2012

On Shift Spaces with Algebraic Structure.
Proceedings of the How the World Computes, 2012

2011
A Survey on Picture-Walking Automata.
Proceedings of the Algebraic Foundations in Computer Science, 2011


  Loading...