Pavel Semukhin

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 23

Top Topics

Concept Classes

Jacobian Matrix

Query Answering

Finite Automata

Top Venues

J. Comput. Syst. Sci.

Publications

Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin
On the Identity and Group Problems for Complex Heisenberg Matrices. RP (2023)
Paul C. Bell, Pavel Semukhin
Decision Questions for Probabilistic Automata on Small Alphabets. Log. Methods Comput. Sci. 19 (4) (2023)
Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin
On the Identity and Group Problems for Complex Heisenberg Matrices. CoRR (2023)
Stefan Kiefer, Pavel Semukhin, Cas Widdershoven
Linear-Time Model Checking Branching Processes. CONCUR (2021)
Stefan Kiefer, Pavel Semukhin, Cas Widdershoven
Linear-Time Model Checking Branching Processes. CoRR (2021)
Paul C. Bell, Igor Potapov, Pavel Semukhin
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond. Inf. Comput. 281 (2021)
Paul C. Bell, Pavel Semukhin
Decision Questions for Probabilistic Automata on Small Alphabets. MFCS (2021)
Paul C. Bell, Pavel Semukhin
Decision Questions for Probabilistic Automata on Small Alphabets. CoRR (2021)
Volker Diekert, Igor Potapov, Pavel Semukhin
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. ISSAC (2020)
Paul C. Bell, Pavel Semukhin
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. CONCUR (2020)
Paul C. Bell, Pavel Semukhin
Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata. CoRR (2020)
Paul C. Bell, Igor Potapov, Pavel Semukhin
Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond. CoRR (2019)
Paul C. Bell, Igor Potapov, Pavel Semukhin
On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond. MFCS (2019)
Volker Diekert, Igor Potapov, Pavel Semukhin
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. CoRR (2019)
Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell
On reachability problems for low dimensional matrix semigroups. CoRR (2019)
Igor Potapov, Pavel Semukhin
Vector and scalar reachability problems in SL(2, Z). J. Comput. Syst. Sci. 100 (2019)
Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell
On Reachability Problems for Low-Dimensional Matrix Semigroups. ICALP (2019)
Igor Potapov, Pavel Semukhin
Preface. Int. J. Found. Comput. Sci. 29 (2) (2018)
Igor Potapov, Pavel Semukhin
Membership Problem in GL(2, Z) Extended by Singular Matrices. MFCS (2017)
Igor Potapov, Pavel Semukhin
Decidability of the Membership Problem for 2 × 2 integer matrices. SODA (2017)
Ekaterina B. Fokina, Bakhadyr Khoussainov, Pavel Semukhin, Daniel Turetsky
Linear Orders Realized by C.E. Equivalence Relations. J. Symb. Log. 81 (2) (2016)
Igor Potapov, Pavel Semukhin
Vector Reachability Problem in SL(2, Z). MFCS (2016)
Igor Potapov, Pavel Semukhin
Decidability of the Membership Problem for 2×2 integer matrices. CoRR (2016)
Igor Potapov, Pavel Semukhin
Vector Reachability Problem in SL(2, Z). CoRR (2015)
Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles
Algebraic methods proving Sauer's bound for teaching complexity. Theor. Comput. Sci. 558 (2014)
Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles
Sample Compression for Multi-label Concept Classes. COLT (2014)
John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin, Frank Stephan
Automatic learners with feedback queries. J. Comput. Syst. Sci. 80 (4) (2014)
Pavel Semukhin, Frank Stephan
Automatic models of first order theories. Ann. Pure Appl. Log. 164 (9) (2013)
John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, Frank Stephan
Automatic learning of subclasses of pattern languages. Inf. Comput. 218 (2012)
Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles
Sauer's Bound for a Notion of Teaching Complexity. ALT (2012)
John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin, Frank Stephan
Automatic Learners with Feedback Queries. CiE (2011)
Sanjay Jain, Qinglong Luo, Pavel Semukhin, Frank Stephan
Uncountable automatic classes and learning. Theor. Comput. Sci. 412 (19) (2011)
John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, Frank Stephan
Automatic Learning of Subclasses of Pattern Languages. LATA (2011)
Pavel Semukhin
Prime models of finite computable dimension. J. Symb. Log. 74 (1) (2009)
André Nies, Pavel Semukhin
Finite automata presentable abelian groups. Ann. Pure Appl. Log. 161 (3) (2009)
Sanjay Jain, Qinglong Luo, Pavel Semukhin, Frank Stephan
Uncountable Automatic Classes and Learning. ALT (2009)
Bakhadyr Khoussainov, Pavel Semukhin, Frank Stephan
Applications of Kolmogorov complexity to computable model theory. J. Symb. Log. 72 (3) (2007)
André Nies, Pavel Semukhin
Finite Automata Presentable Abelian Groups. LFCS (2007)
Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin
-Presentations of Algebras. Arch. Math. Log. 45 (6) (2006)
Bakhadyr Khoussainov, Denis R. Hirschfeldt, Pavel Semukhin
An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated. Notre Dame J. Formal Log. 47 (1) (2006)