1 votes 1 votes Construct a minimal dfa over {0,1} which neither accept 00 as a substring nor 11 as a substring. Theory of Computation theory-of-computation finite-automata normal + – Sahil1994 asked Aug 20, 2017 Sahil1994 3.5k views answer comment Share Follow See 1 comment See all 1 1 comment reply stblue commented Aug 20, 2017 reply Follow Share for such question, always first draw DFA of complement of the language i.e DFA for string that accept 00 or 11 as substring. Then change final state to non final state and vice versa 0 votes 0 votes Please log in or register to add a comment.
Best answer 5 votes 5 votes dfa will be, joshi_nitish answered Aug 20, 2017 • selected Aug 25, 2017 by Sahil1994 joshi_nitish comment Share Follow See all 0 reply Please log in or register to add a comment.