default search action
Ville Salo
Person information
- affiliation: University of Turku, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Ville Salo, Ilkka Törmä:
Finding Codes on Infinite Grids Automatically. Fundam. Informaticae 191(3-4): 331-349 (2024) - [i44]Laurent Bartholdi, Ville Salo:
Shifts on the lamplighter group. CoRR abs/2402.14508 (2024) - [i43]Ville Salo:
Avoshifts. CoRR abs/2408.09711 (2024) - [i42]Laurent Bartholdi, Ville Salo:
Snakes can be fooled into thinking they live in a tree. CoRR abs/2409.14525 (2024) - 2023
- [j18]Ville Salo
, Ilkka Törmä:
A physically universal Turing machine. J. Comput. Syst. Sci. 132: 16-44 (2023) - [j17]Ville Salo
On von Neumann regularity of cellular automata. Nat. Comput. 22(3): 527-538 (2023) - [c30]Ville Salo
Diddy: A Python Toolbox for Infinite Discrete Dynamical Systems. AUTOMATA 2023: 33-47 - [i41]Ville Salo, Ilkka Törmä:
Finding codes on infinite grids automatically. CoRR abs/2303.00557 (2023) - [i40]Sebastián Barbieri, Jarkko Kari, Ville Salo:
The group of reversible Turing machines: subgroups, generators and computability. CoRR abs/2303.17270 (2023) - [i39]Ville Salo, Ilkka Törmä:
Diddy: a Python toolbox for infinite discrete dynamical systems. CoRR abs/2305.01375 (2023) - [i38]Ville Salo, Ilkka Törmä:
Computing backwards with Game of Life, part 1: wires and circuits. CoRR abs/2308.10198 (2023) - 2022
- [j16]Jarkko Peltomäki
Automatic winning shifts. Inf. Comput. 285(Part): 104883 (2022) - [j15]Ville Salo
Cutting corners. J. Comput. Syst. Sci. 128: 35-70 (2022) - [j14]Ville Salo, Guillaume Theyssier, Ilkka Törmä
Cellular automata and bootstrap percolation. Theor. Comput. Sci. 924: 34-45 (2022) - [c29]Ville Salo
Triangle Solitaire. AUTOMATA 2022: 123-136 - [c28]Ville Salo, Ilkka Törmä:
Gardens of Eden in the Game of Life. Automata and Complexity 2022: 399-415 - [c27]Ville Salo, Ilkka Törmä:
What Can Oracles Teach Us About the Ultimate Fate of Life? ICALP 2022: 131:1-131:20 - [i37]Antonin Callard, Ville Salo:
Distortion element in the automorphism group of a full shift. CoRR abs/2208.00685 (2022) - [i36]Ville Salo:
On von Neumann regularity of cellular automata. CoRR abs/2209.13373 (2022) - 2021
- [j13]Ville Salo
Trees in Positive Entropy Subshifts. Axioms 10(2): 77 (2021) - [j12]Ville Salo, Ilkka Törmä:
Nilpotent endomorphisms of expansive group actions. Int. J. Algebra Comput. 31(3): 393-452 (2021) - [c26]Ville Salo:
Von Neumann Regularity, Split Epicness and Elementary Cellular Automata. AUTOMATA 2021: 11:1-11:10 - [i35]Johan Kopra, Ville Salo:
Sofically presented dynamical systems. CoRR abs/2105.06767 (2021) - [i34]Jarkko Peltomäki, Ville Salo:
Automatic winning shifts. CoRR abs/2106.07249 (2021) - [i33]Ville Salo, Guillaume Theyssier, Ilkka Törmä:
Bootstrap Percolation and Cellular Automata. CoRR abs/2110.00656 (2021) - 2020
- [j11]Jarkko Kari, Ville Salo
Sequentializing cellular automata. Nat. Comput. 19(4): 759-772 (2020) - [c25]Ville Salo
Four Heads are Better than Three. Automata 2020: 111-125 - [i32]Ville Salo:
Cutting Corners. CoRR abs/2002.08730 (2020) - [i31]Ville Salo:
Four heads are better than three. CoRR abs/2003.05706 (2020) - [i30]Ville Salo, Ilkka Törmä:
A Physically Universal Turing Machine. CoRR abs/2003.10328 (2020) - [i29]Laurent Bartholdi, Ville Salo:
Simulations and the Lamplighter group. CoRR abs/2010.14299 (2020) - [i28]Ville Salo:
Conjugacy of reversible cellular automata. CoRR abs/2011.07827 (2020) - [i27]Ville Salo:
Graph and wreath products of cellular automata. CoRR abs/2012.10186 (2020)
2010 – 2019
- 2019
- [j10]Jarkko Peltomäki
On winning shifts of marked uniform substitutions. RAIRO Theor. Informatics Appl. 53(1-2): 51-66 (2019) - [i26]Ville Salo:
Alternation diameter of a product object. CoRR abs/1901.03613 (2019) - [i25]Ville Salo:
Minimal subshifts with a language pivot property. CoRR abs/1901.04688 (2019) - [i24]Ville Salo, Ilkka Törmä:
Gardens of Eden in the Game of Life. CoRR abs/1912.00692 (2019) - 2018
- [c24]Jarkko Kari
Sequentializing Cellular Automata. Automata 2018: 72-87 - [i23]Jarkko Kari, Ville Salo, Thomas Worsch:
Sequentializing cellular automata. CoRR abs/1802.06668 (2018) - [i22]Ville Salo:
Von Neumann regularity, split epicness and elementary cellular automata. CoRR abs/1804.03913 (2018) - [i21]Ville Salo:
Universal groups of cellular automata. CoRR abs/1808.08697 (2018) - [i20]Ville Salo:
Universal gates with wires in a row. CoRR abs/1809.08050 (2018) - 2017
- [j9]Ville Salo:
Decidability and universality of quasiminimal subshifts. J. Comput. Syst. Sci. 89: 288-314 (2017) - [j8]Ville Salo, Ilkka Törmä:
Independent finite automata on Cayley graphs. Nat. Comput. 16(3): 411-426 (2017) - [j7]Tim Boykett
Finite generating sets for reversible gate sets under general conservation laws. Theor. Comput. Sci. 701: 27-39 (2017) - [c23]Ville Salo:
Strict Asymptotic Nilpotency in Cellular Automata. AUTOMATA 2017: 3-15 - [c22]Pierre Guillon, Ville Salo:
Distortion in One-Head Machines and Cellular Automata. AUTOMATA 2017: 120-138 - [c21]Ville Salo, Ilkka Törmä:
A One-Dimensional Physically Universal Cellular Automaton. CiE 2017: 375-386 - [i19]Benjamin Hellouin de Menibus, Ville Salo, Guillaume Theyssier:
Characterizing Asymptotic Randomization in Abelian Cellular Automata. CoRR abs/1703.07289 (2017) - [i18]Jarkko Peltomäki, Ville Salo:
On winning shifts of marked uniform substitutions. CoRR abs/1705.08747 (2017) - 2016
- [j6]Eric Goles, Pedro Montealegre
PSPACE-completeness of majority automata networks. Theor. Comput. Sci. 609: 118-128 (2016) - [c20]Sebastián Barbieri
The Group of Reversible Turing Machines. Automata 2016: 49-62 - [c19]Tim Boykett
Strongly Universal Reversible Gate Sets. RC 2016: 239-254 - [c18]Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
Distributed Testing of Excluded Subgraphs. DISC 2016: 342-356 - [i17]Tim Boykett, Jarkko Kari, Ville Salo:
Strongly Universal Reversible Gate Sets. CoRR abs/1602.04967 (2016) - [i16]Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca:
Distributed Testing of Excluded Subgraphs. CoRR abs/1605.03719 (2016) - [i15]Tim Boykett, Jarkko Kari, Ville Salo:
Finite generating sets for reversible gate sets under general conservation laws. CoRR abs/1611.01523 (2016) - 2015
- [j5]Ville Salo, Ilkka Törmä:
Category theory of symbolic dynamics. Theor. Comput. Sci. 567: 21-45 (2015) - [c17]Ville Salo:
Groups and Monoids of Cellular Automata. Automata 2015: 17-45 - [c16]Ville Salo, Ilkka Törmä:
Group-Walking Automata. Automata 2015: 224-237 - [c15]Jarkko Kari
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. SIROCCO 2015: 370-384 - [i14]Ville Salo, Ilkka Törmä:
A One-Dimensional Physically Universal Cellular Automaton. CoRR abs/1501.03988 (2015) - [i13]Eric Goles Ch., Pedro Montealegre, Ville Salo, Ilkka Törmä:
PSPACE-Completeness of Majority Automata Networks. CoRR abs/1501.03992 (2015) - [i12]Ville Salo, Ilkka Törmä:
Factor Colorings of Linearly Recurrent Words. CoRR abs/1504.05821 (2015) - 2014
- [j4]Ville Salo, Ilkka Törmä:
Playing with Subshifts. Fundam. Informaticae 132(1): 131-152 (2014) - [j3]Ville Salo, Ilkka Törmä:
Color Blind Cellular Automata. J. Cell. Autom. 9(5-6): 477-509 (2014) - [j2]Ville Salo:
Realization problems for nonuniform cellular automata. Theor. Comput. Sci. 559: 91-107 (2014) - [c14]Ville Salo, Ilkka Törmä:
Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2. Automata 2014: 121-134 - [c13]Ville Salo, Ilkka Törmä:
Plane-Walking Automata. Automata 2014: 135-148 - [c12]Jarkko Kari
Trace Complexity of Chaotic Reversible Cellular Automata. RC 2014: 54-66 - [i11]Jarkko Kari, Ville Salo, Ilkka Törmä:
Trace Complexity of Chaotic Reversible Cellular Automata. CoRR abs/1404.4519 (2014) - [i10]Ville Salo, Ilkka Törmä:
Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2. CoRR abs/1408.6695 (2014) - [i9]Ville Salo, Ilkka Törmä:
Plane-Walking Automata. CoRR abs/1408.6701 (2014) - [i8]Ville Salo:
Decidability and Universality of Quasiminimal Subshifts. CoRR abs/1411.6644 (2014) - 2013
- [j1]Ville Salo, Ilkka Törmä:
Constructions with Countable Subshifts of Finite Type. Fundam. Informaticae 126(2-3): 263-300 (2013) - [c11]Ville Salo, Ilkka Törmä:
Color Blind Cellular Automata. Automata 2013: 139-154 - [c10]Ville Salo, Ilkka Törmä:
Commutators of Bipermutive and Affine Cellular Automata. Automata 2013: 155-170 - [i7]Ville Salo, Ilkka Törmä:
Block Maps between Primitive Uniform and Pisot Substitutions. CoRR abs/1306.3777 (2013) - [i6]Ville Salo:
Hard Asymptotic Sets for One-Dimensional Cellular Automata. CoRR abs/1307.4910 (2013) - [i5]Ville Salo, Ilkka Törmä:
Playing with Subshifts. CoRR abs/1310.0650 (2013) - [i4]Ville Salo, Ilkka Törmä:
Constructions with Countable Subshifts of Finite Type. CoRR abs/1310.0654 (2013) - 2012
- [c9]Ville Salo, Ilkka Törmä:
On Shift Spaces with Algebraic Structure. CiE 2012: 636-645 - [c8]Ville Salo:
A Characterization of Cellular Automata Generated by Idempotents on the Full Shift. CSR 2012: 290-301 - [c7]Ville Salo, Ilkka Törmä:
Geometry and Dynamics of the Besicovitch and Weyl Spaces. Developments in Language Theory 2012: 465-470 - [c6]Ville Salo, Ilkka Törmä:
On Stable and Unstable Limit Sets of Finite Families of Cellular Automata. LATA 2012: 502-513 - [c5]Ville Salo, Ilkka Törmä:
Computational Aspects of Cellular Automata on Countable Sofic Shifts. MFCS 2012: 777-788 - [c4]Ville Salo, Ilkka Törmä:
On Derivatives and Subpattern Orders of Countable Subshifts. AUTOMATA & JAC 2012: 23-36 - [c3]Ville Salo, Ilkka Törmä:
Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology. AUTOMATA & JAC 2012: 53-68 - [c2]Ville Salo:
On Nilpotency and Asymptotic Nilpotency of Cellular Automata. AUTOMATA & JAC 2012: 86-96 - [i3]Ville Salo, Ilkka Törmä:
On Shift Spaces with Algebraic Structure. CoRR abs/1203.6795 (2012) - [i2]Ville Salo, Ilkka Törmä:
Geometry and Dynamics of the Besicovitch and Weyl Spaces. CoRR abs/1204.5371 (2012) - [i1]Ville Salo:
A Characterization of Cellular Automata Generated by Idempotents on the Full Shift. CoRR abs/1206.0585 (2012) - 2011
- [c1]Jarkko Kari
A Survey on Picture-Walking Automata. Algebraic Foundations in Computer Science 2011: 183-213
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: