The following pages link to Pavel Martyugin (Q442133):
Displayed 16 items.
- Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134) (← links)
- (Q845081) (redirect page) (← links)
- A lower bound for the length of the shortest carefully synchronizing words (Q845082) (← links)
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755) (← links)
- Synchronizing Automata over Nested Words (Q2811343) (← links)
- P(l)aying for Synchronization (Q2914704) (← links)
- Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716) (← links)
- (Q3115697) (← links)
- (Q3450095) (← links)
- Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA (Q3569754) (← links)
- THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA (Q3646172) (← links)
- Careful Synchronization of Partial Automata with Restricted Alphabets (Q4928474) (← links)
- The Length of Subset Reachability in Nondeterministic Automata (Q4982094) (← links)
- Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (Q5200068) (← links)
- Synchronizing Automata over Nested Words (Q5208371) (← links)
- (Q5306174) (← links)