Question

Question 3. Write down a regular expression that denotes the following language.

L = {a mb n : m + n is even}

Question 4. Let L1 be the language denoted by ab∗ a ∗ and let L2 be the language denoted by a ∗ b ∗ a

Write a regular expression that denotes the language L1 ∩ L2.

Answer 1

Solution:

Question 3)

The above problem gives rise to two possible cases.

m+n must be even. To achieve this, we must see that both m and n must be even or both must be odd. Only then m+n can be even.

The two cases are as follows:

n is even and m is even:

The regular expression for this is as follows.

(aa)*(bb)*

m is odd and n is odd:

a(aa)*b(bb)*

Combining the above two cases, the regular expression is as follows.

(aa)*(bb)* + a(aa)*b(bb)*.

Note:

Please see that as per the guidelines only one question can be answered when multiple questions are posted under single question.

In case of multiple choices, upto 4 questions can be answered.

Thank you.