Question: For any string w = w 1 w 2 wn , let mirror ( w ) = wnwn 1 w 1 be its mirror in
For any string w ww wn let mirrorw wnwn w be its mirror in which all its symbols appear
in opposite order. Let L be any regular language. Decide if the following language is regular or not and
prove your claim: Lmirrorw w in L
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
