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. Programming in C theory-of-computation + – reena_kandari asked Jan 27, 2017 reena_kandari 1.3k views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Shaik Masthan commented Aug 26, 2019 reply Follow Share the question was not typed properly... So please write your REXP.. 0 votes 0 votes Satbir commented Aug 26, 2019 reply Follow Share Question is given $RE = (aa + ab)^+ (a + b)^+ (a + b)^+ $ then what would be the number of minimal strings generated using the given $RE$ ? 0 votes 0 votes Shaik Masthan commented Aug 26, 2019 reply Follow Share 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 votes 1 votes Please log in or register to add a comment.
2 votes 2 votes Four Minimal Strings are:- 1)aaa 2)aab 3)aba 4) abb akb1115 answered Mar 21, 2017 akb1115 comment Share Follow See all 0 reply Please log in or register to add a comment.