USA: +1 (725) 712-1730 
Sign in
Define a new operation on languages as follows: (L) = {w|exist w elementof sigma*, ww^R elementof L}, where w^R denotes the “reverse” of the string w. Does preserve regularity?
Expert Answer
Define a new operation on languages as follows: (L) = {w|exist w elementof sigma*, ww^R elementof L}, where w^R denotes the “reverse” of the string w. Does preserve regularity?
