On the Separating Words Problem.

The function $sep(w,x)$ is defined as the size of the smallest DFA that accepts $w$ and rejects $x$. It has remained unsolved until now that whether the difference $| sep(w,x) - sep(w^R, x^R)|$ is bounded or not. In this paper, we prove by construction that this difference is unbounded.