5. If a regular expression for the language over the alphabet {a, b} with no string...

2.  

    

Transcribed Image Text:

5. If a regular expression for the language over the alphabet {a, b} with no string containing the substring bb is (a+ba)*(^+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) 5. If a regular expression for the language over the alphabet {a, b} with no string containing the substring bb is (a+ba)*(^+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)

Answer rating: 100% (QA)

The regular expression for the language over the alphabet ab with no string containing the substring sb is a ba b Heres how the regular expression wor... View the full answer