0 votes 0 votes Let sigma = {0,1} . Construct a dfa for "All strings containing 00 but not 000". Theory of Computation theory-of-computation finite-automata + – Vicky rix asked Apr 2, 2017 retagged Jun 4, 2017 by Arjun Vicky rix 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes Please check,,.Is this correct ? Is this the minimal DFA or ARE THERE ANYOTHER DFA'S WITH LESSER NUMBER OF STATES ? Vicky rix answered Apr 2, 2017 Vicky rix comment Share Follow See all 0 reply Please log in or register to add a comment.