0 votes 0 votes Theory of Computation theory-of-computation minimal-state-automata finite-automata + – Anmol Verma asked Dec 4, 2016 Anmol Verma 1.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes Set of binary strings which is divisible by n can be formed by DFA having n states. So, 8 states. But we can minimize it to 4 states. target2017 answered Dec 4, 2016 edited Dec 7, 2016 by target2017 target2017 comment Share Follow See 1 comment See all 1 1 comment reply Abbas2131 commented Dec 1, 2017 reply Follow Share Incorrect. You are merging final and non final state. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes min. four state is required RAJESHWAR YADAV answered Dec 4, 2016 edited Dec 5, 2016 by RAJESHWAR YADAV RAJESHWAR YADAV comment Share Follow See all 3 Comments See all 3 3 Comments reply Anmol Verma commented Dec 5, 2016 reply Follow Share how 8....?? 0 votes 0 votes Anmol Verma commented Dec 5, 2016 i edited by Anmol Verma Dec 5, 2016 reply Follow Share @rajeshwar yadav can u provide me detailed steps on how to got this minimized dfa..!! as i'm getting 5 states... 0 votes 0 votes RAJESHWAR YADAV commented Dec 5, 2016 reply Follow Share construct the dfa for (0+1)*ooo any string gengerated by this regular expression is divisible by 8 1 votes 1 votes Please log in or register to add a comment.