Show that if L is regular, then the language tail is also regular, where

tail(L) = {y : xy L for some x }