edited by
592 views
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.
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2