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} :

All words in which a is tripled or b is tripled, but not both. This means each word contains the substring aaa or the substring bbb but not both.

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

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: