Exact Codimension-Two Reaching Thresholds for Binary Completely Reachable Automata
Ryutaro Yonezu · Zenodo (CERN European Organization for Nuclear Research) · 2026
Preprint proving the exact worst-case reaching threshold of (n-2)-subsets in n-state binary completely reachable automata for every n >= 4, with an exhaustive finite certificate for the n=8 boundary case.