MadeEasy Test Series: Theory Of Computation - Regular Expressions

Question

Consider the following regular expression (RE) RE= (aa+abb)^+ (a+b+ba)^+ (a+b)^+

How many minimal strings exist for above RE?

(a) 3

(b) 4

(c) 5

(d) 6

Answer 1

Ans is b.....4

For the string to be minimal from first one you have to choose aa and from second and third you can choose either a or b so no of minimal string=2×2=4

Comments

Thank you