0 votes 0 votes write the regular expression for the given language L= { W | NO OF a mod 2= 1} (odd no of a's ) Theory of Computation theory-of-computation regular-expression + – sid1221 asked May 19, 2017 sid1221 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes {(b*ab*ab*)*+b*}ab* or b*a{(b*ab*ab*)*+b*} and for even no. of a = (b*ab*ab*)*+b* pawan kumarln answered May 19, 2017 selected Jul 27, 2017 by pawan kumarln pawan kumarln comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments pawan kumarln commented May 22, 2017 reply Follow Share @LeenSharma,@Arihant sorry u r correct 0 votes 0 votes rohan mishra commented Jul 27, 2017 reply Follow Share it is being accepted. 0 votes 0 votes Udit Gupta 1 commented Sep 16, 2017 reply Follow Share This is the most appropriate method. i.e. create a RE from the DFA. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes assuming set of input symbols a,b ans is:b*a(b*ab*a)*b* aik138463 answered May 19, 2017 aik138463 comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments sid1221 commented May 19, 2017 reply Follow Share only b should also be in language rt ..which will not be get from it . –1 votes –1 votes pawan kumarln commented May 20, 2017 reply Follow Share @sid1221 only b means 0 no.'s of a but 0 no.'s of a is not odd no. of a 1 votes 1 votes sid1221 commented May 20, 2017 reply Follow Share yes you are right .. my bad i did mistake , @aik you cant derive aaba from your expression right ... here people dont want to correct mistakes just want how to downvote someone ... anyway@aik i think you will get ur mistake :) 0 votes 0 votes Please log in or register to add a comment.