1 votes 1 votes Give Regular Expression for Language of all those strings which do not contain the substring ‘bb’. Also draw its DFA. Theory of Computation finite-automata theory-of-computation + – The Capricorn asked Mar 5, 2018 The Capricorn 318 views answer comment Share Follow See 1 comment See all 1 1 comment reply Ananya Jaiswal 1 commented Mar 5, 2018 reply Follow Share draw a dfa for language of strings that contain 'bb' as substring. In this dfa Make FINAL STATES AS NON-FINALA and NON-FINAL STATES AS FINAL to obtain the dfa for language of strings that DO NOT contain 'bb' as substring 1 votes 1 votes Please log in or register to add a comment.
2 votes 2 votes regular expression will be (a+ba)*(∈+b) Sambit Kumar answered Mar 7, 2018 • edited Mar 7, 2018 by Sambit Kumar Sambit Kumar comment Share Follow See all 0 reply Please log in or register to add a comment.