Pavel Semukhin

Pavel Semukhin is a Lecturer in the Department of Computer Science at Liverpool John Moores University, where he contributes to research and teaching in theoretical computer science and mathematical logic.

His research interests include:

• Reachability problems in linear dynamical systems
• Finite and probabilistic automata
• Algorithmic learning theory
• Computability theory
• Computable model theory
• Matrix semigroups and decidability

His recent work focuses on decidability and reachability in low-dimensional matrix semigroups, probabilistic automata, and logical structures, with publications in top venues such as CONCUR, MFCS, ICALP, and SODA. His research often bridges theoretical computer science and mathematical logic, especially in the context of automata, algebra, and learning models.

His collaborative work with researchers like Igor Potapov, Sanjay Jain, and others has led to significant results in matrix problems and algorithmic learning. Though no formal list of students is provided, his publications suggest mentorship and collaboration with early-career researchers. He has also contributed to editorial work, including a special issue for International Journal of Foundations of Computer Science (2018) related to DLT 2015.