The following pages link to Pavel Semukhin (Q387120):
Displaying 29 items.
- Automatic models of first order theories (Q387121) (← links)
- Algebraic methods proving Sauer's bound for teaching complexity (Q465250) (← links)
- Finite automata presentable Abelian groups (Q636284) (← links)
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\) (Q1740664) (← links)
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond (Q2051775) (← links)
- Uncountable automatic classes and learning (Q2431428) (← links)
- An uncountably categorical theory whose only computably presentable model is saturated (Q2505131) (← links)
- \(\Pi^0_1\)-presentations of algebras (Q2505502) (← links)
- Automatic learners with feedback queries (Q2637649) (← links)
- Automatic Learning of Subclasses of Pattern Languages (Q3004579) (← links)
- Automatic Learners with Feedback Queries (Q3091438) (← links)
- Sauer’s Bound for a Notion of Teaching Complexity (Q3164813) (← links)
- LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS (Q3188324) (← links)
- Prime models of finite computable dimension (Q3616356) (← links)
- Uncountable Automatic Classes and Learning (Q3648759) (← links)
- Decidability of the Membership Problem for 2 <b>×</b> 2 integer matrices (Q4575747) (← links)
- Vector Reachability Problem in SL(2, Z) (Q4608647) (← links)
- Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. (Q5089287) (← links)
- On Reachability Problems for Low-Dimensional Matrix Semigroups (Q5091195) (← links)
- On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond (Q5092447) (← links)
- (Q5111259) (← links)
- Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices (Q5145963) (← links)
- Applications of Kolmogorov complexity to computable model theory (Q5422317) (← links)
- Finite Automata Presentable Abelian Groups (Q5434523) (← links)
- Decision Questions for Probabilistic Automata on Small Alphabets (Q6137871) (← links)
- Linear-Time Model Checking Branching Processes (Q6176098) (← links)
- On the identity and group problems for complex Heisenberg matrices (Q6623013) (← links)
- Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices (Q6652394) (← links)
