0 votes 0 votes Write Regular expression for the set of string over alphabets {a, b} starting with b and ending with odd number of a’s or even number of b’s. Theory of Computation theory-of-computation regular-expression + – KartikS asked Jun 18 • edited Jun 18 by Shubham Sharma 2 KartikS 116 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shaik Masthan commented Jun 19 reply Follow Share What's your take on this ? 0 votes 0 votes Ramkrishna Sahu commented Jun 21 i moved by Shaik Masthan Jun 24 reply Follow Share b(a+b)*[ {b*(ab*ab*)*ab*} + { a*(ba*ba*)*} ] 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes b(a+b)*(a^+ + (bb)^+) this can also be the answer as we can have many expression for single language pnn_gate answered 1 day ago pnn_gate comment Share Follow See all 0 reply Please log in or register to add a comment.
