2 votes 2 votes L1= {uvw | u,v,w belongs {a,b}* & |u| =|v| =|w| } a)regular b)cfl c)csl d) recursive answr is regular?. why it is regular? Theory of Computation made-easy-test-series theory-of-computation regular-language + – aaru14 asked Nov 16, 2017 • edited Mar 4, 2019 by adeebafatima1 aaru14 302 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Nov 16, 2017 reply Follow Share because L1 can be rewritten as, L1 = {w | w $\epsilon$ (a+b)* , |w|mod3 = 0 }, which is regular. 2 votes 2 votes srestha commented Nov 16, 2017 reply Follow Share language will be ((a+b)*)n.((a+b)*)n.((a+b)*)n Cancatenation of 3 equal length string yes string will be mod3 and regular 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes $L_1$ can be written simply as $\{ x : x \in (a+b)^*, |x|mod3 = 0\}$. Therefore it is regular. Rishabh Gupta 2 answered Nov 16, 2017 Rishabh Gupta 2 comment Share Follow See 1 comment See all 1 1 comment reply aaru14 commented Nov 16, 2017 reply Follow Share thnx 0 votes 0 votes Please log in or register to add a comment.
