Question

Give regular expressions for the following languages:

(a) The language of all strings over {a,b} except the empty string.

(b) The language of all strings over {a,b} that contain both bab and bba as substrings.

(c)L _k = {w ∈ {a,b} ^* | w contains a substring having 3 more b’s than a’s}.

(d) The language of all strings over {a,b} that have a b in every odd position (first
symbol is considered position 1; empty string should be accepted) or start with a
single a.

Answer 1

PLEASE FIND THE ANSWERS BELOW.