I'm a senior lecturer at the School of Computer Science and Mathematics at the Liverpool John Moores University.
My research interests are decidability questions in different computational models. Mostly focusing on decidability and complexity in various variants of linear dynamical systems, vector addition games, matrix problems and semi-Thue systems.
Before starting this position, I was a university teacher at the University of Liverpool.
Prior to that I worked on verification for infinite-state systems with Prof. Joël Ouaknine and on
algorithmic verification of string-manipulating programs with Prof. Anthony W. Lin at University of Oxford.
I was also a lecturer at Jesus College teaching core first-year computer science courses.
I did my PhD in Liverpool under supervision of Prof. Igor Potapov, Dr Vesa Halava, and Prof. Paul Spirakis.
Short CV
Places I've visited.
* dblp * Google Scholar * ORCID * ResearchGate *
* Expand All * Collapse All *
+ 2024
+ 2023
On the Identity and Group Problems for Complex Heisenberg Matrices,
Paul C. Bell, R.N., Igor Potapov, Pavel Semukhin, in LNCS 14235: 42-55 presented at RP 2023.
+ 2022
+ 2021
Integer weighted automata on infinite words,
Vesa Halava, Tero Harju, R.N., Igor Potapov, in LNCS 12811: 167-179 presented at DLT 2021.
Reachability problems in low-dimensional nondeterministic polynomial maps over integers,
Sang-Ki Ko, R.N., Igor Potapov, in Information and Computation 281: 104785.
+ 2020
+ 2019
Monadic Decomposability of Regular Relations,
Pablo Barceló, Chih-Duo Hong, Xuan-Bach Le, Anthony W. Lin, R.N., in LIPIcs 132: 103:1-103:14 presented at ICALP 2019.
+ 2018
On the Identity Problem for the Special Linear Group and the Heisenberg Group,
Sang-Ki Ko, R.N., Igor Potapov, in LIPIcs 107: 132:1-132:15 presented at ICALP 2018.
Reachability games and related matrix and word problems,
R.N., PhD Thesis.
Reachability Problems in Nondeterministic Polynomial Maps on the Integers,
Sang-Ki Ko, R.N., Igor Potapov, in LNCS 11088: 465-477 presented at DLT 2018.
+ 2017
Reachability problem for polynomial iteration is PSPACE-complete,
R.N., in LNCS 10506: 132-143 presented at RP 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.
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.
+ 2016
Robot Games with States in Dimension One,
R.N., in LNCS 9899: 163-176 presented at RP 2016.
Undecidability of Two-dimensional Robot Games,
R.N., Igor Potapov, Julien Reichert, in LIPIcs 58: 73:1-73:13 presented at MFCS 2016.
+ 2015
On Robot Games of Degree Two,
Vesa Halava, R.N., Igor Potapov, in LNCS 8977: 224-236, presented at LATA 2015.
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games,
Tero Harju, Vesa Halava, R.N., Igor Potapov, in LNCS 9136: 206-215, presented at CiE 2015.
Undecidability of the Universality Problem for 3-State Integer Weighted Büchi Automata,
Vesa Halava, Tero Harju, R.N., Igor Potapov, pre-print.
* Expand All * Collapse All *
All teaching materials can be found on Canvas.
2024-25: Module leader for 5220COMP Algorithm Design, 5229COMP Automata, languages and computation
Semester 1 guest lecture for 6221COMP Contemporary Concepts in Computer Science
Semester 2 Labs for 4216COMP Computer Science Workshop, 6220COMP Computer Graphics and Visualisation
5100COMSCI Sandwich Year - Computer Science supervision, 6200COMP Project supervision
2023-24: Module leader for 5229COMP Automata, languages and computation
Semester 1 Labs for 5220COMP Algorithm Design, guest lecture for 6221COMP Contemporary Concepts in Computer Science
Semester 2 Labs for 4216COMP Computer Science Workshop, 6220COMP Computer Graphics and Visualisation
5100COMSCI Sandwich Year - Computer Science supervision, 6200COMP Project supervision
2022-23: Module leader for 5229COMP Automata, languages and computation
Semester 1 Labs for 5220COMP Algorithm Design, 6122COMP Virtualised Computing Architectures
Semester 2 Labs for 4216COMP Computer Science Workshop, 6120COMP Graphics and Data Visualisation
5100COMSCI Sandwich Year - Computer Science supervision, 6100COMP Project supervision
2021-22: Module leader for 5121COMP Compiler Design
Semester 1 Labs for 4201COMP Computer Systems, 5120COMP Algorithm Design, 6122COMP Virtualised Computing Architectures
Semester 2 Labs for 4203COMP Professional Practice, 4204COMP Data Modelling, 4216COMP Computer Science Workshop, 5100COMP Research Skills, 6120COMP Graphics and Data Visualisation
5100COMSCI Sandwich Year - Computer Science supervision, 6100COMP Project supervision, 7136COMP Project Dissertation supervision
(at University of Liverpool)
2020-21: Lecturer for COMP309 Efficient Sequential Algorithms, Module coordinator for COMP598 MSc Placement Experience and COMP599 MSc Industrial Project, industrial placement supervision, BSc final-year project supervision, MSc project supervision
(at University of Oxford)
2019-20: Lecturer for Digital Systems, Discrete Mathematics, Imperative Programming and Linear Algebra at Jesus College
2018-19: Teaching Assistant for Automata, Logic and Games
(at University of Liverpool)
2017-18: Demonstrator for COMP309 Efficient Sequential Algorithms
2016-17: Demonstrator for COMP108 Algorithmic Foundations, COMP202 Complexity of Algorithms
2015-16: Demonstrator for COMP108 Algorithmic Foundations, COMP118 Logic in Computer Science
2014-15: Demonstrator for COMP108 Algorithmic Foundations
