suffix regular language Can someone give me an idea how to prove this:
suffix(L) = {y | xy $\in $ L for some x $\in$ $\Sigma$ *}. Or suffix is the set of all suffixes of its strings. Prove that if L is regular, then so is suffix(L)

A simple way of doing it is to take a DFA without states that aren't reachable for $L$, and create an NFA for $\mathrm{tail}(L)$ by adding a new start state with $\epsilon$-transitions to all existing states. The NFA is essentially "jumping on board" at any point of a possible computation of the DFA, accepting just tails.
