Separating Words from Every Start State with Horner Automata

Nicholas Tran

We show that a well-known family of deterministic finite automata can be used to distinguish distinct binary strings of the same length from every start state. Further, we establis…