Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Ryutaro Yonezu (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: