“My Lafter Machin (MLM)” recognizes the following strings : (i) a (ii) aba…

UGC NET 2010

“My Lafter Machin (MLM)” recognizes the following strings :

(i) a

(ii) aba

(iii) abaabaaba

(iv) abaabaabaabaabaabaabaabaaba

Using this as an information, how would you compare the following regular expressions ?

(i) (aba)3ˣ

(ii) a·(baa)3ˣ − 1·ba

(iii) ab·(aab)3ˣ − 1·a

  1. A.

    (ii) and (iii) are same; (i) is different.

  2. B.

    (ii) and (iii) are not same.

  3. C.

    (i), (ii) and (iii) are different.

  4. D.

    (i), (ii) and (iii) are same.

Attempted by 37 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…