480 views
3 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.

Position:
Show:

Related questions

0 0 votes
0 0 answers
295
295 views
rdrd44 asked May 3, 2024
295 views
In certain programming languages, comments appear between delimiters such as (* and ) . Let C be the language of all valid delimited comment strings. Such a string in C...
1 1 vote
0 0 answers
524
524 views
Talha Riaz asked Mar 23, 2024
524 views
1. Write regular expressions and draw NFA for the following languages over the alphabet Σ = {a, b}: a. All strings that do not end with aa. b. All strings that contain an...
0 0 votes
1 1 answer
597
597 views
1 1 vote
0 0 answers
349
349 views
LavTheRawkstar asked Jun 25, 2016
349 views
Write Regular Expresssion Foh Keywords and identifier in C++.Also Draw the FSA.