default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlkka Törmä
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Ville Salo, Ilkka Törmä:
Finding Codes on Infinite Grids Automatically. Fundam. Informaticae 191(3-4): 331-349 (2024)- [i29]Ilkka Törmä:
A Class of Countably Covered Two-Dimensional Sofic Shifts. CoRR abs/2409.14967 (2024) - 2023
- [j14]Pierre Marcus
, Ilkka Törmä:
Winning Sets of Regular Languages: Descriptional and Computational Complexity. J. Autom. Lang. Comb. 28(1-3): 89-120 (2023) - [j13]Ville Salo, Ilkka Törmä:
A physically universal Turing machine. J. Comput. Syst. Sci. 132: 16-44 (2023) - [j12]Solène J. Esnay, Alonso Núñez, Ilkka Törmä:
Arithmetical complexity of the language of generic limit sets of cellular automata. J. Comput. Syst. Sci. 134: 20-41 (2023) - [c20]Ville Salo, Ilkka Törmä:
Diddy: A Python Toolbox for Infinite Discrete Dynamical Systems. AUTOMATA 2023: 33-47 - [i28]Ville Salo, Ilkka Törmä:
Finding codes on infinite grids automatically. CoRR abs/2303.00557 (2023) - [i27]Ville Salo, Ilkka Törmä:
Diddy: a Python toolbox for infinite discrete dynamical systems. CoRR abs/2305.01375 (2023) - [i26]Ville Salo, Ilkka Törmä:
Computing backwards with Game of Life, part 1: wires and circuits. CoRR abs/2308.10198 (2023) - [i25]Hervé Sabrié, Ilkka Törmä:
Limit dynamics of elementary cellular automaton 18. CoRR abs/2308.12744 (2023) - 2022
- [j11]Péter Gács, Ilkka Törmä:
Stable Multi-Level Monotonic Eroders. Theory Comput. Syst. 66(1): 322-353 (2022) - [j10]Ville Salo, Guillaume Theyssier, Ilkka Törmä:
Cellular automata and bootstrap percolation. Theor. Comput. Sci. 924: 34-45 (2022) - [c19]Ville Salo, Ilkka Törmä:
Gardens of Eden in the Game of Life. Automata and Complexity 2022: 399-415 - [c18]Ville Salo, Ilkka Törmä:
What Can Oracles Teach Us About the Ultimate Fate of Life? ICALP 2022: 131:1-131:20 - [i24]Solène J. Esnay, Alonso Núñez, Ilkka Törmä:
Arithmetical Complexity of the Language of Generic Limit Sets of Cellular Automata. CoRR abs/2204.06215 (2022) - 2021
- [j9]Ville Salo, Ilkka Törmä:
Nilpotent endomorphisms of expansive group actions. Int. J. Algebra Comput. 31(3): 393-452 (2021) - [c17]Ilkka Törmä:
Fixed Point Constructions in Tilings and Cellular Automata (Invited Talk). AUTOMATA 2021: 4:1-4:13 - [i23]Ilkka Törmä:
Fixed Point Constructions in Tilings and Cellular Automata. CoRR abs/2105.00443 (2021) - [i22]Pierre Marcus, Ilkka Törmä:
Winning Sets of Regular Languages: Descriptional and Computational Complexity. CoRR abs/2105.00452 (2021) - [i21]Ilkka Törmä:
Generically Nilpotent Cellular Automata. CoRR abs/2108.12925 (2021) - [i20]Ville Salo, Guillaume Theyssier, Ilkka Törmä:
Bootstrap Percolation and Cellular Automata. CoRR abs/2110.00656 (2021) - 2020
- [j8]Ilkka Törmä:
Countable Sofic Shifts with a Periodic Direction. Theory Comput. Syst. 64(6): 1042-1066 (2020) - [c16]Ilkka Törmä:
Complexity of Generic Limit Sets of Cellular Automata. Automata 2020: 126-138 - [c15]Pierre Marcus, Ilkka Törmä:
Descriptional Complexity of Winning Sets of Regular Languages. DCFS 2020: 130-141 - [i19]Ville Salo, Ilkka Törmä:
A Physically Universal Turing Machine. CoRR abs/2003.10328 (2020) - [i18]Pierre Marcus, Ilkka Törmä:
Descriptional Complexity of Winning Sets of Regular Languages. CoRR abs/2004.13668 (2020)
2010 – 2019
- 2019
- [i17]Ville Salo, Ilkka Törmä:
Gardens of Eden in the Game of Life. CoRR abs/1912.00692 (2019) - 2018
- [i16]Ilkka Törmä:
Cantor-Bendixson ranks of countable SFTs. CoRR abs/1803.03605 (2018) - [i15]Péter Gács, Ilkka Törmä:
Stable Multi-Level Monotonic Eroders. CoRR abs/1809.09503 (2018) - 2017
- [j7]Ville Salo, Ilkka Törmä:
Independent finite automata on Cayley graphs. Nat. Comput. 16(3): 411-426 (2017) - [c14]Ville Salo, Ilkka Törmä:
A One-Dimensional Physically Universal Cellular Automaton. CiE 2017: 375-386 - 2016
- [j6]Eric Goles, Pedro Montealegre, Ville Salo, Ilkka Törmä:
PSPACE-completeness of majority automata networks. Theor. Comput. Sci. 609: 118-128 (2016) - 2015
- [j5]Ilkka Törmä:
A uniquely ergodic cellular automaton. J. Comput. Syst. Sci. 81(2): 415-442 (2015) - [j4]Ville Salo, Ilkka Törmä:
Category theory of symbolic dynamics. Theor. Comput. Sci. 567: 21-45 (2015) - [c13]Ville Salo, Ilkka Törmä:
Group-Walking Automata. Automata 2015: 224-237 - [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
- [j3]Ville Salo, Ilkka Törmä:
Playing with Subshifts. Fundam. Informaticae 132(1): 131-152 (2014) - [j2]Ville Salo, Ilkka Törmä:
Color Blind Cellular Automata. J. Cell. Autom. 9(5-6): 477-509 (2014) - [c12]Ville Salo, Ilkka Törmä:
Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2. Automata 2014: 121-134 - [c11]Ville Salo, Ilkka Törmä:
Plane-Walking Automata. Automata 2014: 135-148 - [c10]Ilkka Törmä:
Subshifts, MSO Logic, and Collapsing Hierarchies. IFIP TCS 2014: 111-122 - [c9]Jarkko Kari, Ville Salo, Ilkka Törmä:
Trace Complexity of Chaotic Reversible Cellular Automata. RC 2014: 54-66 - [i11]Ilkka Törmä:
Quantifier Extensions of Multidimensional Sofic Shifts. CoRR abs/1401.2294 (2014) - [i10]Jarkko Kari, Ville Salo, Ilkka Törmä:
Trace Complexity of Chaotic Reversible Cellular Automata. CoRR abs/1404.4519 (2014) - [i9]Ilkka Törmä:
Subshifts, MSO Logic, and Collapsing Hierarchies. CoRR abs/1406.7155 (2014) - [i8]Ville Salo, Ilkka Törmä:
Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2. CoRR abs/1408.6695 (2014) - [i7]Ville Salo, Ilkka Törmä:
Plane-Walking Automata. CoRR abs/1408.6701 (2014) - 2013
- [j1]Ville Salo, Ilkka Törmä:
Constructions with Countable Subshifts of Finite Type. Fundam. Informaticae 126(2-3): 263-300 (2013) - [c8]Ville Salo, Ilkka Törmä:
Color Blind Cellular Automata. Automata 2013: 139-154 - [c7]Ville Salo, Ilkka Törmä:
Commutators of Bipermutive and Affine Cellular Automata. Automata 2013: 155-170 - [i6]Ville Salo, Ilkka Törmä:
Block Maps between Primitive Uniform and Pisot Substitutions. CoRR abs/1306.3777 (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) - [i3]Ilkka Törmä:
A Uniquely Ergodic Cellular Automaton. CoRR abs/1310.0670 (2013) - 2012
- [c6]Ville Salo, Ilkka Törmä:
On Shift Spaces with Algebraic Structure. CiE 2012: 636-645 - [c5]Ville Salo, Ilkka Törmä:
Geometry and Dynamics of the Besicovitch and Weyl Spaces. Developments in Language Theory 2012: 465-470 - [c4]Ville Salo, Ilkka Törmä:
On Stable and Unstable Limit Sets of Finite Families of Cellular Automata. LATA 2012: 502-513 - [c3]Ville Salo, Ilkka Törmä:
Computational Aspects of Cellular Automata on Countable Sofic Shifts. MFCS 2012: 777-788 - [c2]Ville Salo, Ilkka Törmä:
On Derivatives and Subpattern Orders of Countable Subshifts. AUTOMATA & JAC 2012: 23-36 - [c1]Ville Salo, Ilkka Törmä:
Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology. AUTOMATA & JAC 2012: 53-68 - [i2]Ville Salo, Ilkka Törmä:
On Shift Spaces with Algebraic Structure. CoRR abs/1203.6795 (2012) - [i1]Ville Salo, Ilkka Törmä:
Geometry and Dynamics of the Besicovitch and Weyl Spaces. CoRR abs/1204.5371 (2012)
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:15 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:
