Question: Assume = { a , b } . Let L = { w | w has an equal number of occurrences of the substrings ab
Assume ab Let L w w has an equal number of occurrences of the substrings ab and ba Words in L include aba, a b abba, babaab Words not in L include ab ba abab, abaabab Show L is a regular language.
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
