0 votes 0 votes Construct a dfa which accept all strings which when interpreted is a multiple of 5 Theory of Computation theory-of-computation + – gabbar asked Feb 27, 2017 gabbar 483 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The DFA contains 5 states : Initial state : q0 Final state : q0 Kamal Pratap answered Mar 8, 2017 Kamal Pratap comment Share Follow See all 0 reply Please log in or register to add a comment.