0 votes 0 votes The operation $tail (L)$ is defined as $tail(L)=$ {$v:uv∈L,u,v∈Σ^*$}. Show that there is an algorithm for determining whether or not $L = tail (L)$ for any regular $L$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language + – Naveen Kumar 3 asked Apr 10, 2019 Naveen Kumar 3 131 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.