3 votes 3 votes Construct a minimal DFA, which accepts set of all strings over {0, 1}, which when interpreted as binary number is divisible by ‘3’. , IS IS this solution right because null string is also accepted which is not in language sumit goyal 1 asked Jul 10, 2017 sumit goyal 1 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes If you want to avoid taking the null string then you must take a new initial state which provides the current initial state (q0) with 0 and q1 state with 1. Otherwise if initial state is final state then it will always have null string in the language set. Kushagra Gusain answered Jul 11, 2017 • edited Jul 11, 2017 by Kushagra Gusain Kushagra Gusain comment Share Follow See 1 comment See all 1 1 comment reply sumit goyal 1 commented Jul 11, 2017 reply Follow Share thnks bhai 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Null is nothing but 0 0/3=0 so it is div by 3 Deepak Raj 1 answered Jul 13, 2017 Deepak Raj 1 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes It s accepted because null string also divisible by '3'. Ajit Singh Rajawat answered Aug 15, 2018 Ajit Singh Rajawat comment Share Follow See all 0 reply Please log in or register to add a comment.
