On Undecidability of Counter Reachability Games in Dimension One. - Vesa Halava; Reino Niskanen; Igor Potapov (CoRR, 2014)

On Robot Games of Degree Two. - Vesa Halava; Reino Niskanen; Igor Potapov (LATA, 2015)

Undecidability of Two-dimensional Robot Games. - Reino Niskanen; Igor Potapov; Julien Reichert (MFCS, 2016)

Robot Games with States in Dimension One. - Reino Niskanen (RP, 2016)

Reachability Problem for Polynomial Iteration Is PSPACE-complete. - Reino Niskanen (RP, 2017)

Small Semi-Thue System Universal with Respect to the Termination Problem. - Vesa Halava; Yuri V. Matiyasevich; Reino Niskanen (Fundam. Informaticae, 2017)

Weighted automata on infinite words in the context of Attacker-Defender games. - Vesa Halava; Tero Harju; Reino Niskanen; Igor Potapov (Inf. Comput., 2017)

Reachability Problems in Nondeterministic Polynomial Maps on the Integers. - Sang-Ki Ko; Reino Niskanen; Igor Potapov (DLT, 2018)

On the Identity Problem for the Special Linear Group and the Heisenberg Group. - Sang-Ki Ko; Reino Niskanen; Igor Potapov (ICALP, 2018)

Reachability games and related matrix and word problems. - Reino Niskanen (2018)

Monadic Decomposability of Regular Relations. - Pablo Barceló; Chih-Duo Hong; Xuan Bach Le; Anthony W. Lin; Reino Niskanen (ICALP, 2019)

On decidability and complexity of low-dimensional robot games. - Reino Niskanen; Igor Potapov; Julien Reichert (J. Comput. Syst. Sci., 2020)

Reachability problems in low-dimensional nondeterministic polynomial maps over integers. - Sang-Ki Ko; Reino Niskanen; Igor Potapov (Inf. Comput., 2021)

On the Identity and Group Problems for Complex Heisenberg Matrices. - Paul C. Bell; Reino Niskanen; Igor Potapov; Pavel Semukhin (RP, 2023)

Integer Weighted Automata on Infinite Words. - Vesa Halava; Tero Harju; Reino Niskanen; Igor Potapov (Int. J. Found. Comput. Sci., 2023)

On simulating Turing machines with matrix semigroups with integrality tests. - Vesa Halava; Reino Niskanen (Theor. Comput. Sci., 2024)