Define the reflection of a string w=w1w2wn, written wR, to be the string wnwn1w1. For example, if w=abcd, then wR= dcba. Now let the reflection of a language L, written LR, be defined as the set of all strings that are the reflection of a string in L, i.e., LR={wRwL}. For example, if L={ab,bc,cd}, then LR={ba,cb,dc}