UGC-NET | UGC NET CS 2016 July – III | Question 24

Consider the following two languages :
L1 = {0i1j| gcd (i, j) = 1}
L2 is any subset of 0*.
Which of the following is correct ?
(A) L1 is regular and L2* is not regular
(B) L1 is not regular and L2* is regular
(C) Both L1 and L2* are regular languages
(D) Both L1 and L2* are not regular languages


Answer: (B)

Explanation: L1 = {0i1j| gcd (i, j) = 1}:
There are infinite pair having gcd 1. We can’t design FA for such language. That’s why L1 is not regular.
L2 is any subset of 0*, we can construct FA for any subset of single alphabet. That’s why L2 is regular.
So, option (B) is correct.


Quiz of this Question

My Personal Notes arrow_drop_up