1 votes 1 votes Find regular expressions for the following languages on {$a, b$}. (a) $L =$ {$w : |w|$ mod $3 = 0$}. (b) $L =$ {$w : n_a (w)$ mod $3 = 0$}. (c) $L =$ {$w : n_a (w)$ mod $5 > 0$}. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-expression + – Naveen Kumar 3 asked Mar 31, 2019 Naveen Kumar 3 1.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes 1.((a+b)(a+b)(a+b))* 2.(b*ab*ab*ab*)* 3.b*(a+ab*a+ab*ab*a+ab*ab*ab*a)b*(b*ab*ab*ab*ab*ab*)* Gurdeep Saini answered Mar 31, 2019 Gurdeep Saini comment Share Follow See all 2 Comments See all 2 2 Comments reply Vijay_Ram commented May 31, 2022 reply Follow Share great ansr 0 votes 0 votes Harsh Saini_1 commented Feb 24, 2023 reply Follow Share I reckon your answer to 2nd part is wrong as it can’t generate b*. It should rather be $(b^*ab^*ab^*a)^* b^*$ 1 votes 1 votes Please log in or register to add a comment.