30.9k views
5 votes
8. Give regular expressions with alphabet {a, b} for

a) All strings containing the substring aaa
b) All strings not containing the substring aaa
c) All strings with exactly 3 a’s.
d) All strings with the number of a’s (3 or greater) divisible by 3

1 Answer

6 votes

Answer:

i think its C

Step-by-step explanation:

User Splonk
by
5.1k points