1,301 views
0 votes
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.

1 Answer

2 votes
2 votes
Four Minimal Strings are:-

1)aaa

2)aab

3)aba

4) abb

Related questions

2 votes
2 votes
3 answers
2
Pranay Datta 1 asked Oct 3, 2015
1,197 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!!!
0 votes
0 votes
0 answers
4
ahmed65956 asked Sep 27, 2023
583 views
Give the translation scheme that converts infix to postfix form for the following grammar. Also generate the annotated parse tree for input string 2+6+1E- E+TE->TT->0|1|2...