Pavel Martyugin

zbMath Openmartyugin.pavel-vMaRDI QIDQ442133

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Synchronizing automata over nested words	2020-01-15	Paper
Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata Theory of Computing Systems	2017-11-07	Paper
Synchronizing automata over nested words Lecture Notes in Computer Science	2016-06-10	Paper
PSPACE-completeness of the problem of checking the careful synchronizability of a partial automaton	2015-11-02	Paper
The length of subset reachability in nondeterministic automata Electronic Notes in Theoretical Computer Science	2015-03-23	Paper
P(l)aying for synchronization International Journal of Foundations of Computer Science	2014-03-10	Paper
Careful synchronization of partial automata with restricted alphabets Computer Science – Theory and Applications	2013-06-14	Paper
Synchronization of automata with one undefined or ambiguous transition Implementation and Application of Automata	2012-09-20	Paper
Complexity of problems concerning reset words for cyclic and Eulerian automata Theoretical Computer Science	2012-08-09	Paper
Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata	2012-02-10	Paper
Complexity of problems concerning reset words for cyclic and Eulerian automata Implementation and Application of Automata	2011-07-29	Paper
Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA Computer Science – Theory and Applications	2010-06-22	Paper
Complexity of problems concerning reset words for some partial cases of automata	2010-04-08	Paper
A lower bound for the length of the shortest carefully synchronizing words Russian Mathematics	2010-02-05	Paper
THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA International Journal of Foundations of Computer Science	2009-11-19	Paper

Research outcomes over time

This page was built for person: Pavel Martyugin