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={ all strings of 1’s whose length is prime} is not regular. i.e., L={1^2,1^3 ,1^5 ,1^7 ,1^11 ,—-} December 9, 2023 Reorganization of Token September 13, 2023 Explain the application of regular expression November 28, 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.
Prove that L={ all strings of 1’s whose length is prime} is not regular. i.e., L={1^2,1^3 ,1^5 ,1^7 ,1^11 ,—-} December 9, 2023
