Jarkko Kari
jkari@utu.fi +358 29 450 4306 +358 50 320 8781 Vesilinnantie 5 Turku |
2 of 6
- Fundamenta Informaticae - Volume 181, issue 2-3, Special Issue on Machines, Computations and Universality
(MCU 2018) (2021) Durand-Lose Jérôme, Kari Jarkko, Verlan Sergey - Fundamenta Informaticae - Volume 181, issue 2-3, Special Issue on Machines, Computations and Universality (MCU2018) Preface (2021)
- Fundamenta Informaticae
- Natural Computing, Volume 20, issue 4, December 2021, Part 1: Special Issue: Unconventional Computation and Natural Computation — Selected papers from the International Conference on Unconventional Computation and Natural Computation 2020 / Special Issue: Intelligent Systems — Selected papers from the Brazilian Conference on Intelligent Systems 2019 (2021) Doty David, Freund Rudolf, Jonoska Nataša, Kari Jarkko, de Carvalho Andre Carlo P. L. F., de Paula Canuto Anne Magaly, Pereira Dimuro Graçaliz
- Nilpotency and periodic points in non-uniform cellular automata (2021)
- Acta Informatica
- On the domino problem of the Baumslag-Solitar groups (2021)
- Theoretical Computer Science
- Preface. Natural Computing (2021) (2021)
- Natural Computing
- Proceedings of the Sixth Russian-Finnish Symposium on Discrete Mathematics (2021) Proceedings of the Sixth Russian-Finnish Symposium on Discrete Mathematics Hakanen Anni, Halava Vesa, Herva Pyry, Kari Jarkko, Laihonen Tero, Petre Ion, Saarela Aleksi
- An algebraic geometric approach to Nivat's conjecture (2020)
- Information and Computation
- 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
- Conjugacy of one-dimensional one-sided cellular automata is undecidable (2018)
- Lecture Notes in Computer Science
- On dynamical complexity of surjective ultimately right-expansive cellular automata (2018)
- Lecture Notes in Computer Science
UTU Research Portal