0 votes 0 votes Let L={w∈(a+b)* |w has even number of b' s} , i.e., L is the set of all strings with even number of b’s. Which of the regular expressions below represents L? (a* ba* b)* a* (ba* b)* a* a* (ba* ba* )* a* b(ba* b)* ba* Theory of Computation regular-language theory-of-computation regular-expression + – Parshu gate asked Nov 16, 2017 Parshu gate 592 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Anu007 commented Nov 17, 2017 reply Follow Share You are free take a* value of a even take null also. try to generate by doing anything. (ba*b)* inside * and outside * need not be same. like (ba2b)3 You are free to take any value of a inside independently from outsode * i.e. ( )* 0 votes 0 votes A_i_$_h commented Nov 18, 2017 reply Follow Share thanku :) 0 votes 0 votes abhishekmehta4u commented Nov 27, 2017 reply Follow Share regular expression of even no of b's is (a*ba*ba*)*+ b* 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes plz refer here: https://gateoverflow.in/2340/gate2010-39 Hira Thakur answered Nov 17, 2017 • selected Nov 19, 2017 by Parshu gate Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.