0 votes 0 votes Theory of Computation finite-automata + – himgta asked Jul 30, 2018 himgta 739 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes for binary string the value to be divisible by : 4 will have 3 states. 5 will have 5 states. so minimum states will be gcd(3,5) which is equal to 1 so we multiply the number of states in this case. 15 states. arvin answered Jul 30, 2018 • selected Jul 31, 2018 by srestha arvin comment Share Follow See all 28 Comments See all 28 28 Comments reply Show 25 previous comments srestha commented Jul 31, 2018 reply Follow Share where wrong? See I drawn the table 0 votes 0 votes arvin commented Jul 31, 2018 reply Follow Share no mam these two states wont be equal do this by calculating 0equi , 1equi, 2equi.... u can prove this. 1 votes 1 votes srestha commented Jul 31, 2018 reply Follow Share yes, it have 5 states not 4 1 votes 1 votes Please log in or register to add a comment.
