×

zbMATH — the first resource for mathematics

Semukhin, Pavel

Compute Distance To:
Author ID: semukhin.pavel Recent zbMATH articles by "Semukhin, Pavel"
Published as: Semukhin, Pavel
External Links: MGP · ORCID
Documents Indexed: 22 Publications since 2006

Publications by Year

Citations contained in zbMATH Open

15 Publications have been cited 53 times in 45 Documents Cited by Year
Linear orders realized by c.e. equivalence relations. Zbl 1371.03049
Fokina, Ekaterina; Khoussainov, Bakhadyr; Semukhin, Pavel; Turetsky, Daniel
8
2016
Finite automata presentable Abelian groups. Zbl 1219.68116
Nies, André; Semukhin, Pavel
6
2009
An uncountably categorical theory whose only computably presentable model is saturated. Zbl 1107.03032
Hirschfeldt, Denis R.; Khoussainov, Bakhadyr; Semukhin, Pavel
6
2006
Finite automata presentable abelian groups. Zbl 1133.68050
Nies, André; Semukhin, Pavel
5
2007
Decidability of the membership problem for \(2\times 2\) integer matrices. Zbl 1410.68245
Potapov, Igor; Semukhin, Pavel
5
2017
Uncountable automatic classes and learning. Zbl 1222.68108
Jain, Sanjay; Luo, Qinglong; Semukhin, Pavel; Stephan, Frank
3
2011
Automatic learners with feedback queries. Zbl 1344.68104
Case, John; Jain, Sanjay; Ong, Yuh Shin; Semukhin, Pavel; Stephan, Frank
3
2011
\(\Pi^0_1\)-presentations of algebras. Zbl 1099.03025
Khoussainov, Bakhadyr; Slaman, Theodore; Semukhin, Pavel
3
2006
Automatic learners with feedback queries. Zbl 1285.68072
Case, John; Jain, Sanjay; Shin Ong, Yuh; Semukhin, Pavel; Stephan, Frank
3
2014
Vector reachability problem in \(\operatorname{SL}(2,\mathbb{Z})\). Zbl 1404.65037
Potapov, Igor; Semukhin, Pavel
3
2016
Automatic learning of subclasses of pattern languages. Zbl 1330.68149
Case, John; Jain, Sanjay; Le, Trong Dao; Ong, Yuh Shin; Semukhin, Pavel; Stephan, Frank
2
2011
Algebraic methods proving Sauer’s bound for teaching complexity. Zbl 1360.68529
Samei, Rahim; Semukhin, Pavel; Yang, Boting; Zilles, Sandra
2
2014
Automatic learning of subclasses of pattern languages. Zbl 1279.68139
Case, John; Jain, Sanjay; Le, Trong Dao; Ong, Yuh Shin; Semukhin, Pavel; Stephan, Frank
2
2012
Uncountable automatic classes and learning. Zbl 1262.68069
Jain, Sanjay; Luo, Qinglong; Semukhin, Pavel; Stephan, Frank
1
2009
Sauer’s bound for a notion of teaching complexity. Zbl 1367.68122
Samei, Rahim; Semukhin, Pavel; Yang, Boting; Zilles, Sandra
1
2012
Decidability of the membership problem for \(2\times 2\) integer matrices. Zbl 1410.68245
Potapov, Igor; Semukhin, Pavel
5
2017
Linear orders realized by c.e. equivalence relations. Zbl 1371.03049
Fokina, Ekaterina; Khoussainov, Bakhadyr; Semukhin, Pavel; Turetsky, Daniel
8
2016
Vector reachability problem in \(\operatorname{SL}(2,\mathbb{Z})\). Zbl 1404.65037
Potapov, Igor; Semukhin, Pavel
3
2016
Automatic learners with feedback queries. Zbl 1285.68072
Case, John; Jain, Sanjay; Shin Ong, Yuh; Semukhin, Pavel; Stephan, Frank
3
2014
Algebraic methods proving Sauer’s bound for teaching complexity. Zbl 1360.68529
Samei, Rahim; Semukhin, Pavel; Yang, Boting; Zilles, Sandra
2
2014
Automatic learning of subclasses of pattern languages. Zbl 1279.68139
Case, John; Jain, Sanjay; Le, Trong Dao; Ong, Yuh Shin; Semukhin, Pavel; Stephan, Frank
2
2012
Sauer’s bound for a notion of teaching complexity. Zbl 1367.68122
Samei, Rahim; Semukhin, Pavel; Yang, Boting; Zilles, Sandra
1
2012
Uncountable automatic classes and learning. Zbl 1222.68108
Jain, Sanjay; Luo, Qinglong; Semukhin, Pavel; Stephan, Frank
3
2011
Automatic learners with feedback queries. Zbl 1344.68104
Case, John; Jain, Sanjay; Ong, Yuh Shin; Semukhin, Pavel; Stephan, Frank
3
2011
Automatic learning of subclasses of pattern languages. Zbl 1330.68149
Case, John; Jain, Sanjay; Le, Trong Dao; Ong, Yuh Shin; Semukhin, Pavel; Stephan, Frank
2
2011
Finite automata presentable Abelian groups. Zbl 1219.68116
Nies, André; Semukhin, Pavel
6
2009
Uncountable automatic classes and learning. Zbl 1262.68069
Jain, Sanjay; Luo, Qinglong; Semukhin, Pavel; Stephan, Frank
1
2009
Finite automata presentable abelian groups. Zbl 1133.68050
Nies, André; Semukhin, Pavel
5
2007
An uncountably categorical theory whose only computably presentable model is saturated. Zbl 1107.03032
Hirschfeldt, Denis R.; Khoussainov, Bakhadyr; Semukhin, Pavel
6
2006
\(\Pi^0_1\)-presentations of algebras. Zbl 1099.03025
Khoussainov, Bakhadyr; Slaman, Theodore; Semukhin, Pavel
3
2006

Citations by Year