Pavel Semukhin

发表

Automatic models of first order theories

Frank Stephan, Pavel Semukhin, 2013, Ann. Pure Appl. Log..

Automatic Learners with Feedback Queries

John Case, Sanjay Jain, Frank Stephan, 2011, CiE.

Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs

Pavel Semukhin, Paul C. Bell, 2020, CONCUR.

Membership Problem in GL(2, Z) Extended by Singular Matrices

Igor Potapov, Pavel Semukhin, P. Semukhin, 2017, MFCS.

Sample Compression for Multi-label Concept Classes

Boting Yang, Sandra Zilles, Pavel Semukhin, 2014, COLT.

Linear Orders Realized by C.E. Equivalence Relations

Ekaterina B. Fokina, Pavel Semukhin, Bakhadyr Khoussainov, 2016, J. Symb. Log..

Finite automata presentable abelian groups

André Nies, Pavel Semukhin, A. Nies, 2007, Ann. Pure Appl. Log..

Automatic learners with feedback queries

John Case, Sanjay Jain, Frank Stephan, 2014, J. Comput. Syst. Sci..

Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices

Volker Diekert, Igor Potapov, Pavel Semukhin, 2020, ISSAC.

Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond pdf

Igor Potapov, Pavel Semukhin, Paul Bell, 2019, ArXiv.

An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated

Denis R. Hirschfeldt, Pavel Semukhin, Bakhadyr Khoussainov, 2006, Notre Dame J. Formal Log..

Vector Reachability Problem in SL(2, Z) pdf

Igor Potapov, Pavel Semukhin, P. Semukhin, 2016, MFCS.

Finite automata presentable abelian groups

André Nies, Pavel Semukhin, 2009, Ann. Pure Appl. Log..

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices.

Volker Diekert, Igor Potapov, Pavel Semukhin, 2019 .

Uncountable Automatic Classes and Learning

Sanjay Jain, Frank Stephan, Pavel Semukhin, 2009, ALT.

Prime models of finite computable dimension

Pavel Semukhin, 2009, J. Symb. Log..

Automatic Learning of Subclasses of Pattern Languages

John Case, Sanjay Jain, Frank Stephan, 2011, LATA.

Vector Reachability Problem in $\mathrm{SL}(2,\mathbb{Z})$

Igor Potapov, Pavel Semukhin, 2000 .

Algebraic methods proving Sauer's bound for teaching complexity

Boting Yang, Sandra Zilles, Pavel Semukhin, 2014, Theor. Comput. Sci..

$$\Pi^0_1$$-Presentations of Algebras

Theodore A. Slaman, Pavel Semukhin, Bakhadyr Khoussainov, 2006, Arch. Math. Log..

Uncountable automatic classes and learning

Sanjay Jain, Frank Stephan, Pavel Semukhin, 2009, Theor. Comput. Sci..

On reachability problems for low dimensional matrix semigroups

Joël Ouaknine, James Worrell, Thomas Colcombet, 2019, International Colloquium on Automata, Languages and Programming.

Vector and scalar reachability problems in SL(2, Z)

Igor Potapov, Pavel Semukhin, P. Semukhin, 2019, J. Comput. Syst. Sci..

Sauer's Bound for a Notion of Teaching Complexity

Boting Yang, Sandra Zilles, Pavel Semukhin, 2012, ALT.

Decidability of the Membership Problem for 2 × 2 integer matrices

Igor Potapov, Pavel Semukhin, P. Semukhin, 2016, SODA.

Automatic Learning of Subclasses of Pattern Languages

John Case, Sanjay Jain, Frank Stephan, 2011, LATA.

On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond

Igor Potapov, Pavel Semukhin, Paul C. Bell, 2019, MFCS.

On reachability problems for low dimensional matrix semigroups pdf

Joël Ouaknine, James Worrell, Thomas Colcombet, 2019, ICALP.

Applications of Kolmogorov complexity to computable model theory

Frank Stephan, Pavel Semukhin, Bakhadyr Khoussainov, 2007, J. Symb. Log..

InlineEquation ID=" IEq4"> EquationSource Format=" TEX"> ImageObject Color=" BlackWhite" FileRef=" 153200613ArticleIEq4. gif" Format=" GIF" Rendition=" HTML" Type=" Linedraw"/>-Presentations of Algebras

Theodore A. Slaman, Pavel Semukhin, Bakhadyr Khoussainov, 2006 .

Decision Questions for Probabilistic Automata on Small Alphabets

Pavel Semukhin, Paul C. Bell, 2021, MFCS.

Linear-Time Model Checking Branching Processes

Stefan Kiefer, Pavel Semukhin, Cas Widdershoven, 2021, CONCUR.

On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond

Igor Potapov, Pavel Semukhin, Paul C. Bell, 2021, Inf. Comput..

Π 01-presentations of algebras ∗

Pavel Semukhin, Bakhadyr Khoussainov, Theodore Slaman, 2005 .

Decidability of the Membership Problem for $2\times 2$ integer matrices

Igor Potapov, Pavel Semukhin, 2016 .