1 problem

Let a deterministic finite automaton have $N$ states, and call a finite sequence of actions a reset word if it sends every initial state to the same state. If reset words exist, le…