0 votes 0 votes No of the states in the DFA accepts all the binary strings where no of 0's are divisible by 8 or 4.. What should be the answer..3 or 4? Theory of Computation theory-of-computation minimal-state-automata numerical-answers + – vaishali jhalani asked Nov 19, 2016 • recategorized Jul 2, 2022 by Lakshman Bhaiya vaishali jhalani 474 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Prashant. commented Nov 19, 2016 reply Follow Share Why 3 give reson for that. it will be 4 na. MOD- $ machine 4 states 0 votes 0 votes vaishali jhalani commented Nov 19, 2016 reply Follow Share we can combine, states with remainder 1 and 3... 0 votes 0 votes focus _GATE commented Nov 19, 2016 reply Follow Share yes 4 is correct .with 3 states we won't be able to satisfy the condition . 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Evernumber divisible by 8 is also divisible by 4. Q0(initial and final state) -----0----> Q1------0--->Q2----0--->Q3-- ^________________________0_________________________| On every sate, we will have a self loop for 1s. So 4 states. Amitabh Tiwari 1 answered Nov 19, 2016 Amitabh Tiwari 1 comment Share Follow See all 0 reply Please log in or register to add a comment.
