The Gateway to Computer Science Excellence
+2 votes
147 views
Which one of the Regular Expression given defines the same language as defined by R = (a + b)* (aa + bb) (a + b)* ?
(a) (a (ba)* + b (ab)*) (a + b)*
(b) (a (ba)* + b (ab)*)* (a + b)*
(c) (a (ba)* (a + bb) + b (ab)* (b + aa)) (a + b)*
(d) (a (ba)* (a + bb) + b (ab)* (b + aa)) (a + b)+
in Theory of Computation by | 147 views
0
Is it C?
0
yes

1 Answer

+4 votes
  • Given regular expression give minimal string is {aa,bb}

a)it given minimal string is {a,b} so it is false.

b)it gives minimal string {null} so it is also false

c) it gives minimal string {aa,bb}

d) it gives smallest string {aaa,bbb}so it is also false.

Option c is true

 

by
+1
Thank you
+1
With this approach can we solve all such type of problems or not?
+1
95%  problem are solved .
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,345 questions
60,484 answers
201,816 comments
95,291 users