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
47 2016 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
42 2017 -presentations of algebras B Khoussainov, T Slaman, P Semukhin
Archive for Mathematical Logic 45 (6), 769-781, 2006
35 2006 On reachability problems for low-dimensional matrix semigroups T Colcombet, J Ouaknine, P Semukhin, J Worrell
arXiv preprint arXiv:1902.09597, 2019
25 2019 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
21 2006 Finite automata presentable Abelian groups A Nies, P Semukhin
Annals of Pure and Applied Logic 161 (3), 458-467, 2009
19 2009 Membership problem in GL (2, Z) extended by singular matrices I Potapov, P Semukhin
Leibniz International Proceedings in Informatics, LIPIcs 83, 44, 2017
18 2017 Algebraic methods proving Sauer's bound for teaching complexity R Samei, P Semukhin, B Yang, S Zilles
Theoretical Computer Science 558, 35-50, 2014
14 2014 Applications of Kolmogorov complexity to computable model theory B Khoussainov, P Semukhin, F Stephan
The Journal of Symbolic Logic 72 (3), 1041-1054, 2007
14 2007 Vector Reachability Problem in I Potapov, P Semukhin
arXiv preprint arXiv:1510.03227, 2015
12 2015 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
11 2021 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
10 2014 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
10 2012 Uncountable automatic classes and learning S Jain, Q Luo, P Semukhin, F Stephan
Theoretical Computer Science 412 (19), 1805-1820, 2011
9 2011 Finite automata presentable abelian groups A Nies, P Semukhin
International Symposium on Logical Foundations of Computer Science, 422-436, 2007
9 2007 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
8 2020 Sample compression for multi-label concept classes R Samei, P Semukhin, B Yang, S Zilles
Conference on Learning Theory, 371-393, 2014
8 2014 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
7 2011 Degree spectra of structures under equivalence relations E Fokina, P Semukhin, D Turetsky
Algebra Log.(2018, to appear), 2018
6 2018 Vector and scalar reachability problems in SL (2, Z) I Potapov, P Semukhin
Journal of Computer and System Sciences 100, 30-43, 2019
5 2019 