Decidability of the Membership Problem for 2 **×** 2 integer matricesI Potapov, P Semukhin Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 30 | 2017 |

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 | 26 | 2016 |

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 | 19 | 2006 |

Finite automata presentable Abelian groups A Nies, P Semukhin Annals of Pure and Applied Logic 161 (3), 458-467, 2009 | 16 | 2009 |

Membership problem in GL (2, Z) extended by singular matrices I Potapov, P Semukhin Leibniz International Proceedings in Informatics, LIPIcs 83, 2017 | 13 | 2017 |

Vector reachability problem in SL (2, ℤ) I Potapov, P Semukhin Schloss Dagstuhl, 2016 | 12 | 2016 |

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 | 12 | 2012 |

Applications of Kolmogorov complexity to computable model theory B Khoussainov, P Semukhin, F Stephan The Journal of Symbolic Logic 72 (3), 1041-1054, 2007 | 11 | 2007 |

-Presentations of Algebras B Khoussainov, T Slaman, P Semukhin Archive for Mathematical Logic 45 (6), 769-781, 2006 | 11 | 2006 |

Algebraic methods proving Sauer's bound for teaching complexity R Samei, P Semukhin, B Yang, S Zilles Theoretical Computer Science 558, 35-50, 2014 | 10 | 2014 |

Finite automata presentable abelian groups A Nies, P Semukhin International Symposium on Logical Foundations of Computer Science, 422-436, 2007 | 9 | 2007 |

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 | 7 | 2011 |

Automatic learners with feedback queries J Case, S Jain, YS Ong, P Semukhin, F Stephan Conference on Computability in Europe, 31-40, 2011 | 6 | 2011 |

Uncountable automatic classes and learning S Jain, Q Luo, P Semukhin, F Stephan Theoretical Computer Science 412 (19), 1805-1820, 2011 | 6 | 2011 |

On Reachability Problems for Low-Dimensional Matrix Semigroups T Colcombet, J Ouaknine, P Semukhin, J Worrell arXiv preprint arXiv:1902.09597, 2019 | 5 | 2019 |

Degree spectra of structures under equivalence relations E Fokina, P Semukhin, D Turetsky Algebra Log.(2018, to appear), 2018 | 5 | 2018 |

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 | 5 | 2014 |

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 | 4 | 2021 |

Sample compression for multi-label concept classes R Samei, P Semukhin, B Yang, S Zilles Conference on Learning Theory, 371-393, 2014 | 4 | 2014 |

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 | 4 | 2012 |