completely_reachable_automata (224B)
1 # Completely reachable automata 2 3 An [automaton] where every nonempty subset of states can be achieved by applying some word on the set of all states 4 5 See [ferens2026recognizing] 6 7 See also: [cerny_conjecture] 8 9 Up: [automata]