Question: Determine a regular expression for the language L over the alphabet {a, b} that consists of all words that have at least one b but
Determine a regular expression for the language L over the alphabet {a, b} that consists of all words that have at least one b but contain exactly one aa substring (and no other as). Example of words in the language are aab, bbbaabbb, bbbbaabbbbbbbb etc. Examples of words that are not in the language are a, aba, bbab, aaabbbb, baabbbbaabb etc.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
