1 votes 1 votes From a language $L$ we create a new language $chop2 (L)$ by removing the two leftmost symbols of every string in $L$. Specifically, $chop2(L) =$ {$w: vw ∈ L,$ with $|v|= 2$}. Show that if $L$ is regular, then $chop2 (L)$ is also regular. Theory of Computation theory-of-computation peter-linz peter-linz-edition4 finite-automata regular-language + – vaibhav singh 3 asked Sep 14, 2018 edited Mar 30, 2019 by Naveen Kumar 3 vaibhav singh 3 592 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shaik Masthan commented Sep 14, 2018 reply Follow Share Given that L is regular. therefore there is no relation btw input alphabet symbols ( i mean no comparission exist btw the alphabet symbols) List all them = { a, abb,ba,bababa,bbaab,.......} ( for example ) cut the last two symbols then also you can have no relation between the input alphabet symbols ===> it is RL 0 votes 0 votes hitendra singh commented Sep 28, 2018 reply Follow Share if W$\epsilon$ (a+b)* then if you remove first two symbol then also the new strings formed belongs to (a+b)* thus L will remain regular . CORRECT ME IF I AM WRONG!!! 0 votes 0 votes Please log in or register to add a comment.