Pavel Semukhin
Pavel Semukhin
University of Oxford
Verified email at semukhin.name - Homepage
Title
Cited by
Cited by
Year
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
302017
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
262016
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
192006
Finite automata presentable Abelian groups
A Nies, P Semukhin
Annals of Pure and Applied Logic 161 (3), 458-467, 2009
162009
Membership problem in GL (2, Z) extended by singular matrices
I Potapov, P Semukhin
Leibniz International Proceedings in Informatics, LIPIcs 83, 2017
132017
Vector reachability problem in SL (2, ℤ)
I Potapov, P Semukhin
Schloss Dagstuhl, 2016
122016
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
122012
Applications of Kolmogorov complexity to computable model theory
B Khoussainov, P Semukhin, F Stephan
The Journal of Symbolic Logic 72 (3), 1041-1054, 2007
112007
-Presentations of Algebras
B Khoussainov, T Slaman, P Semukhin
Archive for Mathematical Logic 45 (6), 769-781, 2006
112006
Algebraic methods proving Sauer's bound for teaching complexity
R Samei, P Semukhin, B Yang, S Zilles
Theoretical Computer Science 558, 35-50, 2014
102014
Finite automata presentable abelian groups
A Nies, P Semukhin
International Symposium on Logical Foundations of Computer Science, 422-436, 2007
92007
Automatic learning of subclasses of pattern languages
J Case, S Jain, TD Le, YS Ong, P Semukhin, F Stephan
International Conference on Language and Automata Theory and Applications …, 2011
72011
Automatic learners with feedback queries
J Case, S Jain, YS Ong, P Semukhin, F Stephan
Conference on Computability in Europe, 31-40, 2011
62011
Uncountable automatic classes and learning
S Jain, Q Luo, P Semukhin, F Stephan
Theoretical Computer Science 412 (19), 1805-1820, 2011
62011
On Reachability Problems for Low-Dimensional Matrix Semigroups
T Colcombet, J Ouaknine, P Semukhin, J Worrell
arXiv preprint arXiv:1902.09597, 2019
52019
Degree spectra of structures under equivalence relations
E Fokina, P Semukhin, D Turetsky
Algebra Log.(2018, to appear), 2018
52018
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
52014
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond
PC Bell, I Potapov, P Semukhin
Information and Computation, 104736, 2021
42021
Sample compression for multi-label concept classes
R Samei, P Semukhin, B Yang, S Zilles
Conference on Learning Theory, 371-393, 2014
42014
Sauer’s bound for a notion of teaching complexity
R Samei, P Semukhin, B Yang, S Zilles
International Conference on Algorithmic Learning Theory, 96-110, 2012
42012
The system can't perform the operation now. Try again later.
Articles 1–20