Description

reverse computes a non-deterministic automaton B recognizing the mirror-image language of a DFA A, that is :

$$w = a_{1} a_{2} ...a_{n} \in L(A) \Leftrightarrow w' = a_{n} a_{n-1} ...a_{1} \in L(B)$$

This algorithm is reused in the Brzozowski's minimization algorithm.