0 votes 0 votes Language {w | ww=www} is regular. How and what is this language? Theory of Computation theory-of-computation regular-language + – gauravkc asked Jan 30, 2018 gauravkc 298 views answer comment Share Follow See 1 comment See all 1 1 comment reply hs_yadav commented Jan 30, 2018 reply Follow Share gaurav ... Question:- Langaugae containing such string W such that... for this W following condition must satisfied.. WW=WWW(concatenation)....and i think for this scenario only some(finite) string exist...like epsilon 3 votes 3 votes Please log in or register to add a comment.
1 votes 1 votes The language will contain ONLY One String and that is Null String(Epsilon). Because for Any other string, ww can never be equal to www. Thus, Regular. Deepak Poonia answered Mar 12, 2018 Deepak Poonia comment Share Follow See all 0 reply Please log in or register to add a comment.