2 citations · 9 across the 13 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.FL2017
On Automata Recognizing Birecurrent Sets
Andrew Ryzhikov
In this note we study automata recognizing birecurrent sets. A set of words is birecurrent if the minimal partial DFA recognizing this set and the minimal partial DFA recognizing t…
cs.FL2017★ 1 cited
Subset Synchronization in Monotonic Automata
Andrew Ryzhikov, Anton Shemyakov
We study extremal and algorithmic questions of subset and careful synchronization in monotonic automata. We show that several synchronization problems that are hard in general auto…
cs.FL2017
Synchronization Problems in Automata without Non-trivial Cycles
Andrew Ryzhikov
We study the computational complexity of various problems related to synchronization of weakly acyclic automata, a subclass of widely studied aperiodic automata. We provide upper a…