Regular Languages: Nondeterminism, Regular Expressions, Closure Properties, non-regular languages:

6. For any string w of length l(w=w1w2wl, where wi), we define following two operations. (a) reversal: wR=wlwl1w1 (Example: w= evian, wR= naive). Show that if a langauge L is regular, reversal of the language, LR is also regular. (b) tail: wT={,wl,wl1wl,,w1wl} (Example: w= asu, wT={,u,su, asu } ). Show that if a language L is regular, tail of the language, LT is also regular