Pavel Semukhin

Available identifiers

zbMath Open semukhin.pavelMaRDI QIDQ387120

List of research outcomes

Publication	Date of Publication	Type
Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices	2024-12-12	Paper
On the identity and group problems for complex Heisenberg matrices	2024-10-23	Paper
Decision Questions for Probabilistic Automata on Small Alphabets	2024-01-16	Paper
Linear-Time Model Checking Branching Processes	2023-08-21	Paper
Decision Questions for Probabilistic Automata on Small Alphabets	2023-08-08	Paper
On the Identity and Group Problems for Complex Heisenberg Matrices	2023-07-11	Paper
On Reachability Problems for Low-Dimensional Matrix Semigroups	2022-07-21	Paper
On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond	2022-07-21	Paper
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.	2022-07-18	Paper
On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond	2021-11-25	Paper
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices	2021-01-22	Paper
https://portal.mardi4nfdi.de/entity/Q5111259	2020-05-26	Paper
Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\)	2019-05-02	Paper
Decidability of the Membership Problem for 2 × 2 integer matrices	2018-07-16	Paper
Vector Reachability Problem in SL(2, Z)	2018-03-21	Paper
LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS	2016-08-19	Paper
Algebraic methods proving Sauer's bound for teaching complexity	2014-10-31	Paper
Automatic learners with feedback queries	2014-02-13	Paper
Automatic models of first order theories	2013-12-11	Paper
Automatic learning of subclasses of pattern languages	2012-11-27	Paper
Sauer’s Bound for a Notion of Teaching Complexity	2012-10-16	Paper
Automatic Learners with Feedback Queries	2011-09-09	Paper
Finite automata presentable Abelian groups	2011-08-26	Paper
Automatic Learning of Subclasses of Pattern Languages	2011-06-03	Paper
Uncountable automatic classes and learning	2011-04-14	Paper
Uncountable automatic classes and learning	2009-12-01	Paper
Prime models of finite computable dimension	2009-03-25	Paper
Finite Automata Presentable Abelian Groups	2008-01-04	Paper
Applications of Kolmogorov complexity to computable model theory	2007-10-17	Paper
An uncountably categorical theory whose only computably presentable model is saturated	2006-10-04	Paper
\(\Pi^0_1\)-presentations of algebras	2006-09-26	Paper

Research outcomes over time

This page was built for person: Pavel Semukhin