0 votes 0 votes is it a regular language? why? Theory of Computation theory-of-computation regular-language + – someshawasthi asked Jan 17, 2023 • retagged Jan 17, 2023 by makhdoom ghaya someshawasthi 357 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Kabir5454 commented Jan 17, 2023 reply Follow Share isn’t it is the set of all even length string ? which is if true obviously regular . 0 votes 0 votes someshawasthi commented Jan 17, 2023 reply Follow Share yes it is regular, but why is it regular? 0 votes 0 votes Godlike commented Jan 17, 2023 reply Follow Share every string in sigma* can be divided into two parts such that number of a’s in first part is same as number of b’s in second part. the regular expression is (a+b)*. if we can write regular expression for any language then it is regular. take two length string for example ‘aa’ i can write it as x=null string and y=aa, number of a in x is 0 and number of b in y is 0 so it is part of language. take ‘bab, i can write it as x= ba and y=b, you can see it satisfies the condition you can try to divide any length string , in such a way by yourself and verify. 1 votes 1 votes Please log in or register to add a comment.