Question: If a regular expression for the language over the alphabet {a, b} with no string containing the substring aa is (b+ab)*(+a), then what is the
If a regular expression for the language over the alphabet {a, b} with no string containing the substring aa is (b+ab)*(+a), then what is the regular expression for the language over the alphabet {a, b, c} with no string containing the substring aa?

If a regular expression for the language over the alphabet {a,b} with no string containing the substring aa is (b+ab)(+a), then what is the regular expression for the language over the alphabet {a,b,c} with no string containing the substring aa ? (4 points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
