292 views
0 votes
0 votes
For a string $a_1a_2…a_n$ define the operation $shift$ as

                   $shift(a_1a_2...a_n)=a_2a_3...a_na_1$
From this, we can define the operation on a language as

                   $shift(L)=$ {$v:v=shift(w$ for some $w∈L$}

Show that regularity is preserved under the shift operation.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
1 votes
1 votes
0 answers
3