Ilkka Törmä
PhD
iatorm@utu.fi : 395 |
Symbolic dynamics; Cellular automata
I am a university lecturer at the Department of Mathematics and Statistics. I obtained my PhD from the University of Turku in 2015. Since then I have worked as a researcher at Boston University (USA), University of Montpellier (France), and now at the University of Turku.
I study cellular automata and multidimensional symbolic dynamics, from both dynamical and computational perspectives. In particular, I am interested in the properties of multidimensional SFTs and sofic shifts, and the relations between their different subclasses.
I regularly teach courses on Euclidean geometry, linear algebra and the Finnish high school mathematics curriculum for teachers.
- 21st International Workshop on Cellular Automata and Discrete Complex Systems – Exploratory Papers of AUTOMATA 2015 (2015) Jarkko Kari, Ilkka Törmä, Michal Szabados
- A Uniquely Ergodic Cellular Automaton (2015)
- Journal of Computer and System Sciences
- Block maps between primitive uniform and Pisot substitutions (2015)
- Ergodic Theory and Dynamical Systems
- Category Theory of Symbolic Dynamics (2015)
- Theoretical Computer Science
- Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2 (2015)
- Lecture Notes in Computer Science
- Group-Walking Automata (2015)
- Lecture Notes in Computer Science
- Plane-Walking Automata (2015)
- Lecture Notes in Computer Science
- Quantifier Extensions of Multidimensional Sofic Shifts (2015)
- Proceedings of the American Mathematical Society
- Structural and Computational Existence Results for Multidimensional Subshifts (2015) Törmä Ilkka
- Color Blind Cellular Automata (2014)
- Journal of Cellular Automata
- Playing with Subshifts (2014)
- Fundamenta Informaticae
- Subshifts, MSO Logic, and Collapsing Hierarchies (2014)
- Lecture Notes in Computer Science
- Trace Complexity of Chaotic Reversible Cellular Automata (2014)
- Lecture Notes in Computer Science
- Color Blind Cellular Automata (2013)
- Lecture Notes in Computer Science
- Commutators of Bipermutive and Affine Cellular Automata (2013)
- Lecture Notes in Computer Science
- Constructions with Countable Subshifts of Finite Type (2013)
- Fundamenta Informaticae
- Surjective Two-Neighbor Cellular Automata on Prime Alphabets (2013)
- IFIG Research Reports
- Computational Aspects of Cellular Automata on Countable Sofic Shifts (2012)
- Lecture Notes in Computer Science
- Geometry and Dynamics of the Besicovitch and Weyl Spaces (2012)
- Lecture Notes in Computer Science
- On Derivatives and Subpattern Orders of Countable Subshifts (2012)
- Electronic Proceedings in Theoretical Computer Science