0 votes 0 votes 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 Theory of Computation made-easy-test-series theory-of-computation regular-expression + – ROHIT SHARMA 5 asked Jul 30, 2018 edited Mar 4, 2019 by Aditi Singh ROHIT SHARMA 5 347 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes 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 Priyanka Agarwal answered Jul 31, 2018 selected Jul 31, 2018 by ROHIT SHARMA 5 Priyanka Agarwal comment Share Follow See 1 comment See all 1 1 comment reply ROHIT SHARMA 5 commented Jul 31, 2018 reply Follow Share Thank you 0 votes 0 votes Please log in or register to add a comment.