Question: Prove the language is not regular: L = {x1#x2#x3 | x1 = x2^R or x1 = x3^R} (R is reverse of the string)
Prove the language is not regular: L = {x1#x2#x3 | x1 = x2^R or x1 = x3^R} (R is reverse of the string)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
