0 votes 0 votes {XWWrY} is regular or not? XYW € (0,1)+ Theory of Computation theory-of-computation regular-language + – alokipandey asked Oct 4, 2017 alokipandey 358 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Angkit commented Oct 4, 2017 reply Follow Share Is it equivalent to * r * ? Then it will be regular. 0 votes 0 votes akash.dinkar12 commented Oct 4, 2017 i edited by akash.dinkar12 Oct 9, 2017 reply Follow Share yes, it is regular... its corresponding regular expression is: (0+1)^+00(0+1)^+ + (0+1)^+11(0+1)^+ 0 votes 0 votes Chandan1990 commented Oct 5, 2017 reply Follow Share you language accept a language which contain either 00 or 11 as substring. Nothing can be infere from given problem about this condition. 0 votes 0 votes akash.dinkar12 commented Oct 5, 2017 reply Follow Share @Chandan Take examples of strings, u will get it its actual meaning why I wrote that regular expression. 0 votes 0 votes Chandan1990 commented Oct 6, 2017 reply Follow Share 00 is accepted by given regular expression, does it belong to grammer.. 0 votes 0 votes akash.dinkar12 commented Oct 9, 2017 reply Follow Share Chandan u r right!! I have updated answer.. 0 votes 0 votes Please log in or register to add a comment.