Question: 6 . For any language L over { 0 , 1 } let Lr = { wr | w in L } . If L
For any language L over let Lr wr w in L If L is regular show that Lr is also regular.
A language is said to be a palindromic language if L Lr ; show that there is a decision algorithm for
this.
Suppose we know that L L and L are regular. Can we conclude from this that L is regular
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
