Regular expression for language which consist of exactly two b’s over the set ∑={a,b} Post author:Educate Post published:September 11, 2023 Post category:FLAT Post comments:0 Comments Regular expression for language which consist of exactly two b’s over the set ∑={a,b} => a*ba*ba* You Might Also Like Prove that L = {a^k | k is a prime number} is not regular December 9, 2023 Regular expression for binary number starts and end with 1 September 11, 2023 Define finite automata September 4, 2023 Leave a Reply Cancel replyCommentEnter your name or username to comment Enter your email address to comment Enter your website URL (optional) Save my name, email, and website in this browser for the next time I comment.