For construct a regular expression defining each of the following languages over the alphabet = {a

Question:

For construct a regular expression defining each of the following languages over the alphabet Σ = {a b} :

(i) All words that do not have the substring ab.
(ii) All words that do not have both the substrings bba and abb.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  answer-question
Question Posted: