1 votes 1 votes Is this language regular? L1:{wxwR∣w,x∈{a,b}∗ and |w|,|x|>0}, wR is the reverse of string w Please explain.. Unknown Category theory-of-computation + – sh!va asked Jun 21, 2016 sh!va 1.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 7 votes 7 votes In this language , first and last letter will be the same either a or b Also whatever comes in the middle will be occupied by the X. hence , regular expression will be $a(a+b)^+a+ b(a+b)^+b$ Kapil answered Jun 21, 2016 • selected Jun 21, 2016 by Praveen Saini Kapil comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments ManojK commented Jun 21, 2016 reply Follow Share oh sorry sir missed that point. 1 votes 1 votes vupadhayayx86 commented Dec 15, 2018 reply Follow Share So what happens when x≥0 in that case it will be regular or not?? @Praveen Saini 0 votes 0 votes Praveen Saini commented Dec 29, 2018 reply Follow Share $(a+b)^+$ will be replaced by $(a+b)^*$ 0 votes 0 votes Please log in or register to add a comment.