Yes your answer is right for that RE

Answer Matched if kleene closure replaced by Positive Closure

R.E. = (aa+ab)^{+} . (a+b) . (a+b)^{+}

0 votes

Consider the following regular expression (RE)

RE = (aa + ab)+ (a + b)+ (a + b)*

How many minimal strings exist for the above RE?

I think answer should be 1 i.e ἑ but answer given is 4.

RE = (aa + ab)+ (a + b)+ (a + b)*

How many minimal strings exist for the above RE?

I think answer should be 1 i.e ἑ but answer given is 4.

0

Yes your answer is right for that RE

Answer Matched if kleene closure replaced by Positive Closure

R.E. = (aa+ab)^{+} . (a+b) . (a+b)^{+}

1

yes, you are right, i** mis-understood **the question ( i read it as Minimal string length instead of no.of minimal strings, when i am thinking about My RE, it's my mistake )

0