0 votes 0 votes Design a DFA that accepts all strings ending with three consecutive zeros over {0,1} Theory of Computation theory-of-computation finite-automata + – dragonball asked Nov 29, 2017 dragonball 4.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes DFA Accepting all strings ending with 000. Ashwin Kulkarni answered Nov 29, 2017 selected Nov 29, 2017 by dragonball Ashwin Kulkarni comment Share Follow See all 0 reply Please log in or register to add a comment.