( en | de | ru )

 

Disambiguation of "Semukhin, Pavel"

Author of the publication

copydeleteadd this publication to your clipboard
Vector and scalar reachability problems in SL(2, Z).

, and . J. Comput. Syst. Sci., (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dietrich Pavel

Wieland Werther Pavel

Ji Pavelka

Jonas Philipp Pavelka

Luciana Pavel

 

Other publications of authors with the same name

P01-Presentations of Algebras., , and . Arch. Math. Log., 45 (6): 769-781 (2006)Decidability of the Membership Problem for 2×2 integer matrices., and . CoRR, (2016)Membership Problem in GL(2, Z) Extended by Singular Matrices., and . MFCS, volume 83 of LIPIcs, page 44:1-44:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Applications of Kolmogorov complexity to computable model theory., , and . J. Symb. Log., 72 (3): 1041-1054 (2007)Automatic Learning of Subclasses of Pattern Languages., , , , , and . LATA, volume 6638 of Lecture Notes in Computer Science, page 192-203. Springer, (2011)Decidability of the Membership Problem for 2 × 2 integer matrices., and . SODA, page 170-186. SIAM, (2017)Prime models of finite computable dimension.. J. Symb. Log., 74 (1): 336-348 (2009)Linear Orders Realized by C.E. Equivalence Relations., , , and . J. Symb. Log., 81 (2): 463-482 (2016)On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond., , and . MFCS, volume 138 of LIPIcs, page 83:1-83:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Decision Questions for Probabilistic Automata on Small Alphabets., and . MFCS, volume 202 of LIPIcs, page 15:1-15:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)