1. Engineering
  2. Computer Science
  3. 5 if a regular expression for the language over the...

Question: 5 if a regular expression for the language over the...

Question details

5. If a regular expression for the language over the alphabet (a, b) with no string containing the substring bb is (a+ba) (A+b), then what is the regular expression for the language over the same alphabet with no string containing the substring a. bbb (3 points) b. bbbb? (3 points)
Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution