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 appears tripled, if at all. This means that every clump of a's contains 3 or 6 or 9 or 1 2 . . . a's.

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

Step by Step Answer:

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