2 votes 2 votes What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7? Theory of Computation theory-of-computation minimal-state-automata finite-automata + – Tuhin Dutta asked Nov 30, 2017 Tuhin Dutta 1.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply junk_mayavi commented Dec 4, 2017 reply Follow Share you can use this discussion for reference. https://stackoverflow.com/questions/21897554/design-dfa-accepting-binary-strings-divisible-by-a-number-n 1 votes 1 votes Please log in or register to add a comment.
3 votes 3 votes The DFA will have 9 states just_bhavana answered Dec 1, 2017 just_bhavana comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Tuhin Dutta commented Dec 4, 2017 reply Follow Share @$ just\_bhavana$ Can you help me out with this question? https://gateoverflow.in/176913/dfa-and-reg-exp 0 votes 0 votes hungrysoul554 commented Jan 14, 2018 reply Follow Share in minimal dfa we should always consider dead states or not ? 0 votes 0 votes neelesh bhakt commented Jan 16, 2018 reply Follow Share as far as i have researched on this topic i think yes minimal dfa have dead state also. 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes 8 is ans neelesh bhakt answered Nov 30, 2017 • edited Dec 1, 2017 by neelesh bhakt neelesh bhakt comment Share Follow See all 3 Comments See all 3 3 Comments reply just_bhavana commented Dec 1, 2017 reply Follow Share It is accepting 0, dfa should accept strings starting with 1 0 votes 0 votes Anu007 commented Dec 1, 2017 reply Follow Share You design DFA correct ? this is not DFA . 0 votes 0 votes neelesh bhakt commented Dec 1, 2017 reply Follow Share What is wrong with the Dfa ?please see the directions of arrows properly. 0 votes 0 votes Please log in or register to add a comment.
