0 votes 0 votes Represent the language over ∑={0,1} containing all possible combinations of 0's and 1's but not having two consecutive 0's. Theory of Computation regular-expression theory-of-computation + – Devshree Dubey asked Aug 15, 2018 Devshree Dubey 1.1k views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Devshree Dubey commented Aug 15, 2018 reply Follow Share @arvin,@Sumit Singh Chauhan,according to you then it'll be at first that we draw the DFA and then landed at the RE?Am I right? 0 votes 0 votes arvin commented Aug 15, 2018 reply Follow Share yes it will be more easy :p 0 votes 0 votes Devshree Dubey commented Aug 15, 2018 reply Follow Share @arvin,Tysm. :) 0 votes 0 votes Please log in or register to add a comment.