Question: Question 3 Provide a regular expression defining a language M over the alphabet E = {a b} such that all words in the language have

Question 3 Provide a regular expression defining a language M over the alphabet E = {a b} such that all words in the language have exactly three b's or four b's, no less and no more. Thus M would contain words like bbb, bbbb, abbba, abababb and ababababa. Words like abbbabb, abbaa, and aabaa would not be in M
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
