Question: Prove that the language { x in { a , b , c } | x contains an equal number of occurrences of ab and

Prove that the language
{x in {a, b, c}
| x contains an equal number of occurrences of ab and ba as substrings}
is not 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 Databases Questions!