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

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 Databases Questions!