Automata, Computability and Complexity Theory Group,

Department of Computer Science,

University of Liverpool

Department of Computer Science,

University of Liverpool

*** Personal Info *** Publications *** Awards *** Teaching *** Other Duties *** Other *** Contact ***

Research Associate, 01/2018-

* Department of Computer Science, University of Liverpool, UK. *

PhD student, 10/2014-07/2018

* Title of PhD Thesis: Reachability games and related matrix and word problems
Supervisors: Prof. Igor Potapov, Dr Vesa Halava, and Prof. Paul Spirakis
Department of Computer Science, University of Liverpool, UK. *

Project Reseacher, 10/2013-09/2014

*Dept of Mathematics and Statistics,
University of Turku, Finland*

SET for BRITAIN 2016, finalist in a poster competition in the House of Commons

Nokia Foundation's Nokia Scholarship 2014

Postgraduate Research Studentship, Dept of Computer Science, University of Liverpool, 10/2014-09/2017

M.Sc. in Mathematics, 02/2013-08/2013

*Thesis: “On Decidability of the Mortality Problem for Small Integer Matrices” (in Finnish)
Dept of Mathematics and Statistics,
University of Turku, Finland*

B.Sc. in Mathematics, 09/2007-02/2013

* Dept of Mathematics and Statistics,
University of Turku, Finland*

Reachability problem for polynomial iteration is PSPACE-complete,

R.N. in proc. of RP 2017, LNCS 10506: 132-143, 2017.

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

Vesa Halava, Yuri Matiyasevich, R.N., in Fundamenta Informaticae, 154(1-4): 177-184, 2017.

Weighted Automata on Infinite Words in the Context of Attacker-Defender Games,

Tero Harju, Vesa Halava, R.N., Igor Potapov, in Information and Computation 255: 27-44, 2017.

Robot Games with States in Dimension One,

R.N. in proc. of RP 2016, LNCS 9899: 163-176, 2016.

Undecidability of Two-dimensional Robot Games,

R.N., Igor Potapov, Julien Reichert in proc. of MFCS 2016, LIPIcs 58: 73:1-73:13, 2016.

On Robot Games of Degree Two,

Vesa Halava, R.N., Igor Potapov in proc. of LATA 2015, LNCS 8977: 224-236, 2015.

Weighted Automata on Infinite Words in the Context of Attacker-Defender Games,

Tero Harju, Vesa Halava, R.N., Igor Potapov, in proc. of CiE 2015, LNCS 9136: 206-215, 2015.

Undecidability for integer weighted Buchi automata and Robot Games with states,

Vesa Halava, Tero Harju, R.N., Igor Potapov
at RuFiDiM, 2014.

Undecidability of the Universality Problem for 3-State Integer Weighted Büchi Automata,

Vesa Halava, Tero Harju, R.N., Igor Potapov, pre-print, 2014.

Reviewer for journals FI, IJFCS, JCSS.

Subreviewer for conferences CPM 2015, DLT 2014, 2015, 2016, LATIN 2018, SOFSEM 2018.

Subreviewer for conferences CPM 2015, DLT 2014, 2015, 2016, LATIN 2018, SOFSEM 2018.

Association Computability in Europe

European Association for Theoretical Computer Science

European Association for Theoretical Computer Science

19th International Conference on Developments in Language Theory (Liverpool, UK),

9th International Conference on WORDS (Turku, Finland),

Salomaa 80 - conference dedicated to academician Arto Salomaa on his 80th birthday (Turku, Finland).

9th International Conference on WORDS (Turku, Finland),

Salomaa 80 - conference dedicated to academician Arto Salomaa on his 80th birthday (Turku, Finland).

Last Modified: February 2018