P01-Presentations of Algebras. - Bakhadyr Khoussainov; Theodore A. Slaman; Pavel Semukhin (Arch. Math. Log., 2006)

An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated. - Bakhadyr Khoussainov; Denis R. Hirschfeldt; Pavel Semukhin (Notre Dame J. Formal Log., 2006)

Applications of Kolmogorov complexity to computable model theory. - Bakhadyr Khoussainov; Pavel Semukhin; Frank Stephan 001 (J. Symb. Log., 2007)

Finite automata presentable abelian groups. - André Nies; Pavel Semukhin (Ann. Pure Appl. Log., 2009)

Prime models of finite computable dimension. - Pavel Semukhin (J. Symb. Log., 2009)

Uncountable automatic classes and learning. - Sanjay Jain 001; Qinglong Luo; Pavel Semukhin; Frank Stephan 001 (Theor. Comput. Sci., 2011)

Sauer's Bound for a Notion of Teaching Complexity. - Rahim Samei; Pavel Semukhin; Boting Yang; Sandra Zilles (ALT, 2012)

Automatic learning of subclasses of pattern languages. - John Case; Sanjay Jain 001; Trong Dao Le; Yuh Shin Ong; Pavel Semukhin; Frank Stephan 001 (Inf. Comput., 2012)

Automatic models of first order theories. - Pavel Semukhin; Frank Stephan 001 (Ann. Pure Appl. Log., 2013)

Sample Compression for Multi-label Concept Classes. - Rahim Samei; Pavel Semukhin; Boting Yang; Sandra Zilles (COLT, 2014)

Automatic learners with feedback queries. - John Case; Sanjay Jain 001; Yuh Shin Ong; Pavel Semukhin; Frank Stephan 001 (J. Comput. Syst. Sci., 2014)

Algebraic methods proving Sauer's bound for teaching complexity. - Rahim Samei; Pavel Semukhin; Boting Yang; Sandra Zilles (Theor. Comput. Sci., 2014)

Vector Reachability Problem in SL(2, Z). - Igor Potapov; Pavel Semukhin (MFCS, 2016)

Linear Orders Realized by C.E. Equivalence Relations. - Ekaterina B. Fokina; Bakhadyr Khoussainov; Pavel Semukhin; Daniel Turetsky (J. Symb. Log., 2016)

Membership Problem in GL(2, Z) Extended by Singular Matrices. - Igor Potapov; Pavel Semukhin (MFCS, 2017)

Decidability of the Membership Problem for 2 × 2 integer matrices. - Igor Potapov; Pavel Semukhin (SODA, 2017)

Preface. - Igor Potapov; Pavel Semukhin (Int. J. Found. Comput. Sci., 2018)

On Reachability Problems for Low-Dimensional Matrix Semigroups. - Thomas Colcombet; Joël Ouaknine; Pavel Semukhin; James Worrell 001 (ICALP, 2019)

Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond. - Paul C. Bell; Igor Potapov; Pavel Semukhin (CoRR, 2019)

Vector and scalar reachability problems in SL(2, Z). - Igor Potapov; Pavel Semukhin (J. Comput. Syst. Sci., 2019)

Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. - Paul C. Bell; Pavel Semukhin (CONCUR, 2020)

Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. - Volker Diekert; Igor Potapov; Pavel Semukhin (ISSAC, 2020)

Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata. - Paul C. Bell; Pavel Semukhin (CoRR, 2020)

Linear-Time Model Checking Branching Processes. - Stefan Kiefer; Pavel Semukhin; Cas Widdershoven (CONCUR, 2021)

On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond. - Paul C. Bell; Igor Potapov; Pavel Semukhin (Inf. Comput., 2021)

On the Identity and Group Problems for Complex Heisenberg Matrices. - Paul C. Bell; Reino Niskanen; Igor Potapov; Pavel Semukhin (RP, 2023)

Decision Questions for Probabilistic Automata on Small Alphabets. - Paul C. Bell; Pavel Semukhin (Log. Methods Comput. Sci., 2023)

Decidability of Membership Problems for Flat Rational Subsets of ( boldsymbol{{ textrm{GL}}(2, boldsymbol{{ mathbb{Q}}})} ) and Singular Matrices. - Volker Diekert; Igor Potapov; Pavel Semukhin (SIAM J. Comput., 2024)