340 views
3 votes
3 votes

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)3x

(ii) a.(baa)3x–1. ba

(iii) ab.(aab).3x–1.a

(A) (ii) and (iii) are same, (i) is different.

(B) (ii) and (iii) are not same.

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

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

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
2
LavTheRawkstar asked Jun 25, 2016
185 views
Write Regular Expresssion Foh Keywords and identifier in C++.Also Draw the FSA.