Chistikov D., Martyugin P., Shirmohammadi M., “Synchronizing automata over nested words”, Lecture Notes in Computer Science, 9634 (2016), 252–268
Martyugin P.,, “Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata”, Theory of Computing Systems, 54:2 (2014), 293–304
Fominykh F., Martyugin P., Volkov M., “P(l)aying for Synchronization”, International Journal of Foundations of Computer Science, 24/6 (2014), 765–780
Martyugin P., “Careful Synchronization of Partial Automata with Restricted Alphabets”, Lecture Notes in Computer Science, 7913 (2013), 76–87
Martyugin P., “Complexity of problems concerning reset words for cyclic and Eulerian automata”, Theoretical Computer Science, 450 (2012), 3–9
П. В. Мартюгин, “Нижняя оценка длины кратчайших бережно синхронизирующих слов”, Изв. вузов. Матем., 2010, № 1, 59–68; P. V. Martyugin, “A lower bound for the length of the shortest carefully synchronizing words”, Russian Math. (Iz. VUZ), 54:1 (2010), 46–54
П. В. Мартюгин, “Нижние оценки длины кратчайших бережно синхронизирующих слов для двух- и трёхбуквенных частичных автоматов”, Дискретн. анализ и исслед. опер., 15:4 (2008), 44–56
Полный список публикаций
