Pavel Semukhin

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