0 votes 0 votes (a) All strings that do not end with aa. (b) All strings that contain an even number of b’s. (c) All strings which do not contain the substring ba. Theory of Computation theory-of-computation regular-language regular-expression + – Don't you worry asked Jun 1, 2016 retagged Jun 4, 2017 by Arjun Don't you worry 5.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes A. Eps+ a + b + (a + b)*(ab + ba + bb) B. a*(ba*ba*)* C. a*b* shekhar chauhan answered Jun 1, 2016 selected Jun 1, 2016 by Don't you worry shekhar chauhan comment Share Follow See all 2 Comments See all 2 2 Comments reply vijaycs commented Jun 1, 2016 reply Follow Share (y) 0 votes 0 votes Mayankprakash commented Jul 17, 2018 reply Follow Share @shekhar Can you please explain option A 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes ..... abhishekmehta4u answered Mar 30, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.