0 votes 0 votes the minimal finite automata accepting the set of all strings over { 0, 1} starting with 1 that interpreted as the binary representation of an integer are congruent to 0 modulo 5 has ______ states. shubham007 asked Aug 19, 2018 shubham007 495 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply arvin commented Aug 19, 2018 reply Follow Share 7states. 0 votes 0 votes Mizuki commented Aug 19, 2018 reply Follow Share It must be 7 states. A minimal DFA which accepts strings divisible by 5 contains 5 states. In the first production you have to add a dead state for transition on 0 and the first state would have transition 1 going to the next state and the rest is as usual for 0mod5. 0 votes 0 votes Please log in or register to add a comment.