default search action
Pavel Semukhin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j15]Paul C. Bell, Pavel Semukhin:
Decision Questions for Probabilistic Automata on Small Alphabets. Log. Methods Comput. Sci. 19(4) (2023) - [c16]Paul C. Bell
, Reino Niskanen
On the Identity and Group Problems for Complex Heisenberg Matrices. RP 2023: 42-55 - [i9]Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin:
On the Identity and Group Problems for Complex Heisenberg Matrices. CoRR abs/2307.05283 (2023) - 2021
- [j14]Paul C. Bell
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond. Inf. Comput. 281: 104736 (2021) - [c15]Stefan Kiefer, Pavel Semukhin, Cas Widdershoven:
Linear-Time Model Checking Branching Processes. CONCUR 2021: 6:1-6:16 - [c14]Paul C. Bell
Decision Questions for Probabilistic Automata on Small Alphabets. MFCS 2021: 15:1-15:17 - [i8]Paul C. Bell, Pavel Semukhin:
Decision Questions for Probabilistic Automata on Small Alphabets. CoRR abs/2105.10293 (2021) - [i7]Stefan Kiefer, Pavel Semukhin, Cas Widdershoven:
Linear-Time Model Checking Branching Processes. CoRR abs/2107.01687 (2021) - 2020
- [c13]Paul C. Bell
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. CONCUR 2020: 22:1-22:16 - [c12]Volker Diekert, Igor Potapov, Pavel Semukhin:
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. ISSAC 2020: 122-129 - [i6]Paul C. Bell, Pavel Semukhin:
Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata. CoRR abs/2002.07660 (2020)
2010 – 2019
- 2019
- [j13]Igor Potapov, Pavel Semukhin:
Vector and scalar reachability problems in SL(2, Z). J. Comput. Syst. Sci. 100: 30-43 (2019) - [c11]Thomas Colcombet
On Reachability Problems for Low-Dimensional Matrix Semigroups. ICALP 2019: 44:1-44:15 - [c10]Paul C. Bell
On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond. MFCS 2019: 83:1-83:15 - [i5]Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell:
On reachability problems for low dimensional matrix semigroups. CoRR abs/1902.09597 (2019) - [i4]Paul C. Bell, Igor Potapov, Pavel Semukhin:
Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond. CoRR abs/1902.10188 (2019) - [i3]Volker Diekert, Igor Potapov, Pavel Semukhin:
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. CoRR abs/1910.02302 (2019) - 2018
- [j12]Igor Potapov, Pavel Semukhin:
Preface. Int. J. Found. Comput. Sci. 29(2): 139-142 (2018) - 2017
- [c9]Igor Potapov, Pavel Semukhin:
Membership Problem in GL(2, Z) Extended by Singular Matrices. MFCS 2017: 44:1-44:13 - [c8]Igor Potapov, Pavel Semukhin
Decidability of the Membership Problem for 2 × 2 integer matrices. SODA 2017: 170-186 - 2016
- [j11]Ekaterina B. Fokina
Linear Orders Realized by C.E. Equivalence Relations. J. Symb. Log. 81(2): 463-482 (2016) - [c7]Igor Potapov, Pavel Semukhin
Vector Reachability Problem in SL(2, Z). MFCS 2016: 84:1-84:14 - [i2]Igor Potapov, Pavel Semukhin:
Decidability of the Membership Problem for 2×2 integer matrices. CoRR abs/1604.02303 (2016) - 2015
- [i1]Igor Potapov, Pavel Semukhin:
Vector Reachability Problem in SL(2, Z). CoRR abs/1510.03227 (2015) - 2014
- [j10]John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin
Automatic learners with feedback queries. J. Comput. Syst. Sci. 80(4): 806-820 (2014) - [j9]Rahim Samei, Pavel Semukhin
Algebraic methods proving Sauer's bound for teaching complexity. Theor. Comput. Sci. 558: 35-50 (2014) - [c6]Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles:
Sample Compression for Multi-label Concept Classes. COLT 2014: 371-393 - 2013
- [j8]Pavel Semukhin
Automatic models of first order theories. Ann. Pure Appl. Log. 164(9): 837-854 (2013) - 2012
- [j7]John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin
Automatic learning of subclasses of pattern languages. Inf. Comput. 218: 17-35 (2012) - [c5]Rahim Samei, Pavel Semukhin
Sauer's Bound for a Notion of Teaching Complexity. ALT 2012: 96-110 - 2011
- [j6]Sanjay Jain, Qinglong Luo, Pavel Semukhin
Uncountable automatic classes and learning. Theor. Comput. Sci. 412(19): 1805-1820 (2011) - [c4]John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin
Automatic Learners with Feedback Queries. CiE 2011: 31-40 - [c3]John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin
Automatic Learning of Subclasses of Pattern Languages. LATA 2011: 192-203
2000 – 2009
- 2009
- [j5]André Nies
Finite automata presentable abelian groups. Ann. Pure Appl. Log. 161(3): 458-467 (2009) - [j4]Pavel Semukhin
Prime models of finite computable dimension. J. Symb. Log. 74(1): 336-348 (2009) - [c2]Sanjay Jain, Qinglong Luo, Pavel Semukhin
Uncountable Automatic Classes and Learning. ALT 2009: 293-307 - 2007
- [j3]Bakhadyr Khoussainov, Pavel Semukhin
Applications of Kolmogorov complexity to computable model theory. J. Symb. Log. 72(3): 1041-1054 (2007) - [c1]André Nies, Pavel Semukhin
Finite Automata Presentable Abelian Groups. LFCS 2007: 422-436 - 2006
- [j2]Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin
P01-Presentations of Algebras. Arch. Math. Log. 45(6): 769-781 (2006) - [j1]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): 63-71 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: