search
Log In
0 votes
466 views
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.
in Programming 466 views
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)+

0

@Shaik Masthan

 

How answer matched i.e 4 ?

I got 8.

please correct me.

 

1

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

0

@Shaik Masthan

Here answer will be 4 only right ?

0
didn't ger you
0
what is the answer of the question ? if at last we have positive closure instead of kleene closure
0
the question was not typed properly... So please write your REXP..
0
Question is

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

then what would be the number of minimal strings generated using the given $RE$ ?
1
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

1 Answer

2 votes
Four Minimal Strings are:-

1)aaa

2)aab

3)aba

4) abb

Related questions

2 votes
3 answers
2
520 views
no of state in minimal finite automata that accept the string from alphabet {a,b,c} where no of a is divisible by 2 or 3 and no of c is divisible by 6?? plzz explain!!!
asked Oct 3, 2015 in Theory of Computation Pranay Datta 1 520 views
0 votes
1 answer
3
178 views
The number of strings present of length 10 in language $L=\left \{ a^{2n+1}.b^{2m+1}|n\geq 0,m\geq 0 \right \} $ are_________ My explanation: I think here minimum string ab , and $8$ gap is present. So, like counting we can solve it. That means these $8$ place we can fill with either $a$ or $b$ Where is wrong in it?
asked Nov 27, 2018 in Theory of Computation srestha 178 views
0 votes
1 answer
4
...