Question: The language L = {w | w contains as many occurrences of the substring ab as occurences of the substring ba} is regular. Prove it
The language L = {w | w contains as many occurrences of the substring ab as occurences of the substring ba} is regular. Prove it by giving an FA (deterministic or non-deterministic) for L. Explain why this FA accepts this language.
Examples:
accepted: aba, baaabab
not accepted: abb, abababab
thank you!
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
