A series of slowly synchronizable automata with a zero state over a small alphabet. - Pavel V. Martugin (LATA, 2007)

Complexity of problems concerning reset words for commutative automata and automata with simple idempotents. - Pavel V. Martyugin (AFL, 2008)

A series of slowly synchronizing automata with a zero state over a small alphabet. - Pavel V. Martugin (Inf. Comput., 2008)

Complexity of Problems Concerning Reset Words for Some Partial Cases of Automata. - Pavel Martyugin (Acta Cybern., 2009)

The Length of Subset Reachability in Nondeterministic Automata. - Pavel Martyugin (Int. J. Found. Comput. Sci., 2009)

Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA. - Pavel V. Martyugin (CSR, 2010)

Synchronization of Automata with One Undefined or Ambiguous Transition. - Pavel V. Martyugin (CIAA, 2012)

Complexity of problems concerning reset words for cyclic and Eulerian automata. - Pavel Martyugin (Theor. Comput. Sci., 2012)

Careful Synchronization of Partial Automata with Restricted Alphabets. - Pavel V. Martyugin (CSR, 2013)

P(L)Aying for Synchronization. - Fedor M. Fominykh; Pavel V. Martyugin; Mikhail V. Volkov 001 (Int. J. Found. Comput. Sci., 2013)

Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata. - Pavel Martyugin (Theory Comput. Syst., 2014)

Synchronizing Automata over Nested Words. - Dmitry Chistikov 001; Pavel Martyugin; Mahsa Shirmohammadi (J. Autom. Lang. Comb., 2019)