We stand with Ukraine

We stand with Ukraine

Ilkka Törmä

Orcid: 0000-0001-5541-8517

According to our database¹, Ilkka Törmä authored at least 43 papers between 2012 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org

On csauthors.net:

Bibliography

2023

Arithmetical complexity of the language of generic limit sets of cellular automata.

[BibT_eX]

[DOI]

Solène J. Esnay

,

,

J. Comput. Syst. Sci., June, 2023

A physically universal Turing machine.

[BibT_eX]

[DOI]

,

J. Comput. Syst. Sci., 2023

Winning Sets of Regular Languages: Descriptional and Computational Complexity.

[BibT_eX]

[DOI]

,

J. Autom. Lang. Comb., 2023

Limit dynamics of elementary cellular automaton 18.

[BibT_eX]

[DOI]

,

CoRR, 2023

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

[BibT_eX]

[DOI]

,

CoRR, 2023

Finding codes on infinite grids automatically.

[BibT_eX]

[DOI]

,

CoRR, 2023

Diddy: A Python Toolbox for Infinite Discrete Dynamical Systems.

[BibT_eX]

[DOI]

,

Proceedings of the Cellular Automata and Discrete Complex Systems, 2023

2022

Cellular automata and bootstrap percolation.

[BibT_eX]

[DOI]

,

Guillaume Theyssier

,

Theor. Comput. Sci., 2022

Stable Multi-Level Monotonic Eroders.

[BibT_eX]

[DOI]

,

Theory Comput. Syst., 2022

What Can Oracles Teach Us About the Ultimate Fate of Life?

[BibT_eX]

[DOI]

,

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Gardens of Eden in the Game of Life.

[BibT_eX]

[DOI]

,

Proceedings of the Automata and Complexity, 2022

2021

Nilpotent endomorphisms of expansive group actions.

[BibT_eX]

[DOI]

,

Int. J. Algebra Comput., 2021

Bootstrap Percolation and Cellular Automata.

[BibT_eX]

[DOI]

,

Guillaume Theyssier

,

CoRR, 2021

Generically Nilpotent Cellular Automata.

[BibT_eX]

[DOI]

CoRR, 2021

Fixed Point Constructions in Tilings and Cellular Automata.

[BibT_eX]

[DOI]

CoRR, 2021

Fixed Point Constructions in Tilings and Cellular Automata (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, 2021

2020

Countable Sofic Shifts with a Periodic Direction.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Descriptional Complexity of Winning Sets of Regular Languages.

[BibT_eX]

[DOI]

,

Proceedings of the Descriptional Complexity of Formal Systems, 2020

Complexity of Generic Limit Sets of Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata and Discrete Complex Systems, 2020

2018

Cantor-Bendixson ranks of countable SFTs.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Independent finite automata on Cayley graphs.

[BibT_eX]

[DOI]

,

Nat. Comput., 2017

A One-Dimensional Physically Universal Cellular Automaton.

[BibT_eX]

[DOI]

,

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

PSPACE-completeness of majority automata networks.

[BibT_eX]

[DOI]

,

Pedro Montealegre

,

,

Theor. Comput. Sci., 2016

2015

Category theory of symbolic dynamics.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2015

A uniquely ergodic cellular automaton.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Factor Colorings of Linearly Recurrent Words.

[BibT_eX]

[DOI]

,

CoRR, 2015

Group-Walking Automata.

[BibT_eX]

[DOI]

,

Proceedings of the Cellular Automata and Discrete Complex Systems, 2015

2014

Color Blind Cellular Automata.

[BibT_eX]

[DOI]

,

J. Cell. Autom., 2014

Playing with Subshifts.

[BibT_eX]

[DOI]

,

Fundam. Informaticae, 2014

Quantifier Extensions of Multidimensional Sofic Shifts.

[BibT_eX]

[DOI]

CoRR, 2014

Trace Complexity of Chaotic Reversible Cellular Automata.

[BibT_eX]

[DOI]

,

,

Proceedings of the Reversible Computation - 6th International Conference, 2014

Subshifts, MSO Logic, and Collapsing Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2014

Plane-Walking Automata.

[BibT_eX]

[DOI]

,

Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2.

[BibT_eX]

[DOI]

,

Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

2013

Constructions with Countable Subshifts of Finite Type.

[BibT_eX]

[DOI]

,

Fundam. Informaticae, 2013

Block Maps between Primitive Uniform and Pisot Substitutions.

[BibT_eX]

[DOI]

,

CoRR, 2013

Commutators of Bipermutive and Affine Cellular Automata.

[BibT_eX]

[DOI]

,

Proceedings of the Cellular Automata and Discrete Complex Systems, 2013

2012

Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology

[BibT_eX]

[DOI]

,

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

[BibT_eX]

[DOI]

,

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.

[BibT_eX]

[DOI]

,

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

On Stable and Unstable Limit Sets of Finite Families of Cellular Automata.

[BibT_eX]

[DOI]

,

Proceedings of the Language and Automata Theory and Applications, 2012

Geometry and Dynamics of the Besicovitch and Weyl Spaces.

[BibT_eX]

[DOI]

,

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

On Shift Spaces with Algebraic Structure.

[BibT_eX]

[DOI]

,

Proceedings of the How the World Computes, 2012

Loading...