The Gateway to Computer Science Excellence
0 votes
304 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 by Loyal (8.3k points) | 304 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
by Active (3.3k points)
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
50,737 questions
57,292 answers
198,226 comments
104,909 users