A new lower bound for reset threshold of synchronizing automata with sink state
Abstract
We present a new series of examples of binary slowly synchronizing automata with sink state. The reset threshold of the n-state automaton in this series is n24+2n-9. This improves on the previously known lower bound for the maximum reset threshold of binary synchronizing n-state automata with sink state.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.