0 votes 0 votes Is this language regular or not? xww^R | x,w E (a,b)* Theory of Computation regular-language context-free-language context-sensitive + – navaneethsaj asked 3 days ago navaneethsaj 46 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shaik Masthan commented 3 days ago reply Follow Share In general, one can think like ab-abc-cbc is not belongs to the language. But, if we interpret it as ababccbc - epsilon - epsilon, then it is belongs to the language. So idea here is, just keep w = epsilon always, then remaining will be x. - every string is accepted. It is universal language- Regular. 2 votes 2 votes navaneethsaj commented 3 days ago reply Follow Share Thank you 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes If you put w=$\varepsilon$ then L = x where x$\epsilon$(a+b)*so, L = (a+b)*Hence, Given Language is Regular. manishankarkanrar answered 3 days ago manishankarkanrar comment Share Follow See all 0 reply Please log in or register to add a comment.