Pavel Martyugin

From MaRDI portal
Person:442133

Available identifiers

zbMath Open martyugin.pavel-vMaRDI QIDQ442133

List of research outcomes





PublicationDate of PublicationType
Synchronizing Automata over Nested Words2020-01-15Paper
Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata2017-11-07Paper
Synchronizing Automata over Nested Words2016-06-10Paper
https://portal.mardi4nfdi.de/entity/Q34500952015-11-02Paper
The Length of Subset Reachability in Nondeterministic Automata2015-03-23Paper
P(l)aying for Synchronization2014-03-10Paper
Careful Synchronization of Partial Automata with Restricted Alphabets2013-06-14Paper
P(l)aying for Synchronization2012-09-20Paper
Synchronization of Automata with One Undefined or Ambiguous Transition2012-09-20Paper
Complexity of problems concerning reset words for cyclic and Eulerian automata2012-08-09Paper
https://portal.mardi4nfdi.de/entity/Q31156972012-02-10Paper
Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata2011-07-29Paper
Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA2010-06-22Paper
https://portal.mardi4nfdi.de/entity/Q53061742010-04-08Paper
A lower bound for the length of the shortest carefully synchronizing words2010-02-05Paper
THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA2009-11-19Paper

Research outcomes over time

This page was built for person: Pavel Martyugin

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:442133&oldid=10787870"
Powered by MediaWiki