Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 20.11.1982
Phone: +7 (912) 046 33 15
E-mail:
Keywords: finite automata, syncronization, computational complexity.
UDC: 519.713.2, 519.713

Subject:

Finite automata, syncronization, computational complexity.

Main publications:

1. Chistikov D., Martyugin P., Shirmohammadi M., “Synchronizing automata over nested words”, Lecture Notes in Computer Science, 9634 (2016), 252–268
2. 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
3. Fominykh F., Martyugin P., Volkov M., “P(l)aying for Synchronization”, International Journal of Foundations of Computer Science, 24/6 (2014), 765–780
4. Martyugin P., “Careful Synchronization of Partial Automata with Restricted Alphabets”, Lecture Notes in Computer Science, 7913 (2013), 76–87
5. Martyugin P., “Complexity of problems concerning reset words for cyclic and Eulerian automata”, Theoretical Computer Science, 450 (2012), 3–9

Publications in Math-Net.Ru

Personal pages:

• 
• 
• 
• 
• 

Organisations:

• Ural Federal University named after the First President of Russia B. N. Yeltsin, Ekaterinburg
• Ural State University, Ekaterinburg