Follow
Pavel Semukhin
Pavel Semukhin
Liverpool John Moores University
Verified email at semukhin.name - Homepage
Title
Cited by
Cited by
Year
Linear orders realized by ce equivalence relations
E Fokina, B Khoussainov, P Semukhin, D Turetsky
The Journal of Symbolic Logic 81 (2), 463-482, 2016
462016
Decidability of the Membership Problem for 2 × 2 integer matrices
I Potapov, P Semukhin
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
352017
-presentations of algebras
B Khoussainov, T Slaman, P Semukhin
Archive for Mathematical Logic 45 (6), 769-781, 2006
332006
An uncountably categorical theory whose only computably presentable model is saturated
B Khoussainov, DR Hirschfeldt, P Semukhin
Notre Dame Journal of Formal Logic 47 (1), 63-71, 2006
212006
On reachability problems for low-dimensional matrix semigroups
T Colcombet, J Ouaknine, P Semukhin, J Worrell
arXiv preprint arXiv:1902.09597, 2019
202019
Finite automata presentable Abelian groups
A Nies, P Semukhin
Annals of Pure and Applied Logic 161 (3), 458-467, 2009
192009
Membership problem in GL (2, Z) extended by singular matrices
I Potapov, P Semukhin
42nd International Symposium on Mathematical Foundations of Computer Science …, 2017
152017
Algebraic methods proving Sauer's bound for teaching complexity
R Samei, P Semukhin, B Yang, S Zilles
Theoretical Computer Science 558, 35-50, 2014
132014
Vector reachability problem in SL (2, Z)
I Potapov, P Semukhin
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
122016
Applications of Kolmogorov complexity to computable model theory
B Khoussainov, P Semukhin, F Stephan
The Journal of Symbolic Logic 72 (3), 1041-1054, 2007
122007
Automatic learners with feedback queries
J Case, S Jain, YS Ong, P Semukhin, F Stephan
Journal of Computer and System Sciences 80 (4), 806-820, 2014
102014
Automatic learning of subclasses of pattern languages
J Case, S Jain, TD Le, YS Ong, P Semukhin, F Stephan
Information and Computation 218, 17-35, 2012
102012
Finite automata presentable abelian groups
A Nies, P Semukhin
International Symposium on Logical Foundations of Computer Science, 422-436, 2007
92007
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond
PC Bell, I Potapov, P Semukhin
Information and Computation 281, 104736, 2021
72021
Sample compression for multi-label concept classes
R Samei, P Semukhin, B Yang, S Zilles
Conference on Learning Theory, 371-393, 2014
72014
Automatic learning of subclasses of pattern languages
J Case, S Jain, TD Le, YS Ong, P Semukhin, F Stephan
Language and Automata Theory and Applications: 5th International Conference …, 2011
72011
Decidability of membership problems for flat rational subsets of GL (2, Q) and singular matrices
V Diekert, I Potapov, P Semukhin
Proceedings of the 45th International Symposium on Symbolic and Algebraic …, 2020
62020
Degree spectra of structures under equivalence relations
E Fokina, P Semukhin, D Turetsky
Algebra Log.(2018, to appear), 2018
62018
Vector and scalar reachability problems in SL (2, Z)
I Potapov, P Semukhin
Journal of Computer and System Sciences 100, 30-43, 2019
52019
Sauer’s bound for a notion of teaching complexity
R Samei, P Semukhin, B Yang, S Zilles
Algorithmic Learning Theory: 23rd International Conference, ALT 2012, Lyon …, 2012
52012
The system can't perform the operation now. Try again later.
Articles 1–20