Minimal String

Question

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.

Comments

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)⁺

---

@Shaik Masthan

 

How answer matched i.e 4 ?

I got 8.

please correct me.

 

---

@HeadShot

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 )

---

@Shaik Masthan

Here answer will be 4 only right ?

---

didn't ger you

---

what is the answer of the question ? if at last we have positive closure instead of kleene closure

---

the question was not typed properly... So please write your REXP..

---

Question is

given $RE  = (aa + ab)^+ (a + b)^+ (a + b)^+ $

then what would be the number of minimal strings generated using the given $RE$ ?

---

aa a a

aa a b

aa b a

aa b b

ab a a

ab a b

ab b a

ab b b

total = 8

Answer 1

Four Minimal Strings are:-

1)aaa

2)aab

3)aba

4) abb