Reino Niskanen

According to our database, Reino Niskanen authored at least 16 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

On simulating Turing machines with matrix semigroups with integrality tests.

Vesa Halava, Reino Niskanen

Theor. Comput. Sci., 2024

2023

Integer Weighted Automata on Infinite Words.

Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov

Int. J. Found. Comput. Sci., 2023

On the Identity and Group Problems for Complex Heisenberg Matrices.

Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin

Proceedings of the Reachability Problems - 17th International Conference, 2023

2021

Reachability problems in low-dimensional nondeterministic polynomial maps over integers.

Sang-Ki Ko, Reino Niskanen, Igor Potapov

Inf. Comput., 2021

2020

On decidability and complexity of low-dimensional robot games.

Reino Niskanen, Igor Potapov, Julien Reichert

J. Comput. Syst. Sci., 2020

2019

Monadic Decomposability of Regular Relations.

Pablo Barceló, Chih-Duo Hong, Xuan Bach Le, Anthony W. Lin, Reino Niskanen

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Reachability games and related matrix and word problems.

Reino Niskanen

PhD thesis, 2018

On the Identity Problem for the Special Linear Group and the Heisenberg Group.

Sang-Ki Ko, Reino Niskanen, Igor Potapov

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Reachability Problems in Nondeterministic Polynomial Maps on the Integers.

Sang-Ki Ko, Reino Niskanen, Igor Potapov

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

Weighted automata on infinite words in the context of Attacker-Defender games.

Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov

Inf. Comput., 2017

Small Semi-Thue System Universal with Respect to the Termination Problem.

Vesa Halava, Yuri V. Matiyasevich, Reino Niskanen

Fundam. Informaticae, 2017

Reachability Problem for Polynomial Iteration Is PSPACE-complete.

Reino Niskanen

Proceedings of the Reachability Problems - 11th International Workshop, 2017

2016

Robot Games with States in Dimension One.

Reino Niskanen

Proceedings of the Reachability Problems - 10th International Workshop, 2016

Undecidability of Two-dimensional Robot Games.

Reino Niskanen, Igor Potapov, Julien Reichert

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

On Robot Games of Degree Two.

Vesa Halava, Reino Niskanen, Igor Potapov

Proceedings of the Language and Automata Theory and Applications, 2015

2014

On Undecidability of Counter Reachability Games in Dimension One.

Vesa Halava, Reino Niskanen, Igor Potapov

CoRR, 2014