Regular expression in theory of computation solved examples

Solution:

We have the input alphabets are ∑ = {a, b}

Here, the resultant regular expression will denote the set of all strings over the given ∑ = {a, b} which must start with two consecutive 0’s i.e. 00.

For this, fist write the regular expression which represent the set of all strings over the given ∑ = {a, b}. It is-

(0 + 1)*

Now, the regular expression which fulfill the requirement of given question can be written as-

00 (0 + 1)*