1 votes 1 votes L = {w1w2 : w1, w2 ϵ {a, b}* , |w1| = |w2|}, Is the Language regular? Explain. Theory of Computation theory-of-computation regular-language + – nishant279 asked Aug 17, 2017 nishant279 2.0k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply stblue commented Aug 17, 2017 i edited by stblue Aug 17, 2017 reply Follow Share yes its regular, it will accept language with even length strings. 2 votes 2 votes Shubhanshu commented Aug 17, 2017 reply Follow Share it is of form (a+b)^2n // n >=0. 0 votes 0 votes Raushank2 commented Aug 17, 2017 reply Follow Share can you design DFA for it? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Yes the language is regular because for that we can make a FA and FA is same as for language containing even number of (a,b). suraj prasad shaw answered Jun 3, 2019 suraj prasad shaw comment Share Follow See all 0 reply Please log in or register to add a comment.