1 votes 1 votes Theory of Computation theory-of-computation regular-expression + – Mahesha999 asked Dec 25, 2016 Mahesha999 2.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Option A : Regular Expression = (a+b)*. Reason: As w and wr both are Nullable.And all the strings generated by them are already present in x. Option B : Regular Expression = a(a+b)*a + b(a+b)*b. Reason: As w and wr both can be eat up by x. Option C : Regular Expression = a(a+b)*b. Reason: As it represents the strings starting with 'a' and ending with 'b'. Jason GATE answered Jan 8, 2017 edited Jan 13, 2017 by Jason GATE Jason GATE comment Share Follow See all 2 Comments See all 2 2 Comments reply Prerna Chauhan commented Jan 13, 2017 reply Follow Share What about option C? it is a(a+b)*b so it must also be regular. 0 votes 0 votes Jason GATE commented Jan 13, 2017 reply Follow Share yes you are right. See the updated answer. 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes According to me, option A, B, C are correct as The moment x = (0+1)* X can eat up the properties of both wwr and anbn Thus making the language regular bhargav9873 answered Feb 13, 2017 bhargav9873 comment Share Follow See all 0 reply Please log in or register to add a comment.