Jarkko Kari
jkari@utu.fi Vesilinnantie 5 Turku |
- Decidability and Periodicity of Low Complexity Tilings (2020)
- LIPICS – Leibniz International Proceedings in Informatics
- Decidability in group shifts and group cellular automata (2020)
- LIPICS – Leibniz International Proceedings in Informatics
- Foundations of reversible computation (2020)
- Lecture Notes in Computer Science
- On Expansivity and Pseudo-Orbit Tracing Property for Cellular Automata (2020)
- Fundamenta Informaticae
- On the conjugacy problem of cellular automata (2020)
- Information and Computation
- Low-Complexity Tilings of the Plane (2019)
- Lecture Notes in Computer Science
- Nivat's conjecture and pattern complexity in algebraic subshifts (2019)
- Theoretical Computer Science
- Sequentializing cellular automata (2019)
- Natural Computing
- Undecidable word problem in subshift automorphism groups (2019)
- Lecture Notes in Computer Science
- Words of Minimum Rank in Deterministic Finite Automata (2019)
- Lecture Notes in Computer Science



