Question: 6 . For any language L over { 0 , 1 } let Lr = { wr | w in L } . If L

6. For any language L over {0,1} let Lr ={wr |w in L}. If L is regular show that Lr is also regular.
7. A language is said to be a palindromic language if L = Lr ; show that there is a decision algorithm for
this.
8. Suppose we know that L1 L2 and L1 are regular. Can we conclude from this that L2 is regular ?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!