Question: Consider the language L= {w*R(w)/we {a, b}* and w indicates w with each occurrence of a' replaced by 'b' and vice-versa}. Now give a PDA
Consider the language L= {w*R(w)/we {a, b}* and w indicates w with each occurrence of a' replaced by 'b' and vice-versa}. Now give a PDA with only two states which accepts L. Is aababb = L ? If so show it.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
