recategorized by
1,016 views
1 votes
1 votes

"My Laughter Machine (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)3^{x}–1.ba$ 

(iii) $ab.(aab).^{3x - 1}.a$ 

  1. $(ii)$ and $(iii)$ are same, $(i)$ is different.
  2. $(ii)$ and $(iii)$ are not same.
  3. $(i), (ii)$ and $(iii)$ are different.
  4. $(i), (ii)$ and $(iii)$ are same.
recategorized by

1 Answer

0 votes
0 votes
D is the answer.... All are same because for any value of x=1,2,3.... all the RE generating same equivalent length strings....

Related questions

0 votes
0 votes
0 answers
1
1 votes
1 votes
1 answer
2
makhdoom ghaya asked Sep 16, 2016
1,882 views
At any given time Parallel Virtual Machine (PVM) has _______ send buffer and ________ receive buffer.One-oneOne-twoTwo-twoTwo-one
0 votes
0 votes
0 answers
3
0 votes
0 votes
1 answer
4
makhdoom ghaya asked Sep 16, 2016
1,366 views
A leased special high-speed connection from the local telephone carrier for business users that transmits at $1.544$ mbps is known as ________ carrier.$T_{1}$$T_{2}$$T_{3...