1 votes 1 votes Define $exchange(a_1a_2a_3...a_{n-1}a_n)=a_na_2a_3...a_{n-1}a_1$, and $exchange(L)=$ {$v:v=exchange(w)$ for some $w∈L$} Show that the family of regular languages is closed under exchange. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language closure-property + – Naveen Kumar 3 asked Apr 5, 2019 Naveen Kumar 3 360 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.