We stand with Ukraine  

Pavel Martyugin

Affiliations:
  • Ural State University, Ekaterinburg, Russia


According to our database1, Pavel Martyugin authored at least 12 papers between 2007 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Synchronizing Automata over Nested Words.
[BibTeX]
[DOI]
Dmitry Chistikov
,
Pavel Martyugin
,
Mahsa Shirmohammadi
J. Autom. Lang. Comb., 2019

2014
Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata.
[BibTeX]
[DOI]
Pavel Martyugin
Theory Comput. Syst., 2014

2013
P(L)Aying for Synchronization.
[BibTeX]
[DOI]
Fedor M. Fominykh
,
Pavel V. Martyugin
,
Mikhail V. Volkov
Int. J. Found. Comput. Sci., 2013

Careful Synchronization of Partial Automata with Restricted Alphabets.
[BibTeX]
[DOI]
Pavel V. Martyugin
Proceedings of the Computer Science - Theory and Applications, 2013

2012
Complexity of problems concerning reset words for cyclic and Eulerian automata.
[BibTeX]
[DOI]
Pavel Martyugin
Theor. Comput. Sci., 2012

Synchronization of Automata with One Undefined or Ambiguous Transition.
[BibTeX]
[DOI]
Pavel V. Martyugin
Proceedings of the Implementation and Application of Automata, 2012

2010
Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA.
[BibTeX]
[DOI]
Pavel V. Martyugin
Proceedings of the Computer Science, 2010

2009
The Length of Subset Reachability in Nondeterministic Automata.
[BibTeX]
[DOI]
Pavel Martyugin
Int. J. Found. Comput. Sci., 2009

Complexity of Problems Concerning Reset Words for Some Partial Cases of Automata.
[BibTeX]
[DOI]
Pavel Martyugin
Acta Cybern., 2009

2008
A series of slowly synchronizing automata with a zero state over a small alphabet.
[BibTeX]
[DOI]
Pavel V. Martugin
Inf. Comput., 2008

Complexity of problems concerning reset words for commutative automata and automata with simple idempotents.
[BibTeX]
Pavel V. Martyugin
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007
A series of slowly synchronizable automata with a zero state over a small alphabet.
[BibTeX]
Pavel V. Martugin
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007


  Loading...