0 votes 0 votes . Construct the minimal finite automata that accept all the strings of 0’s and 1’s where the integer equivalent of the binary string is congruent to 3 mod 6. What is the no. of states in the minimal finite automata? altamash asked Sep 18, 2018 altamash 283 views answer comment Share Follow See 1 comment See all 1 1 comment reply Somoshree Datta 5 commented Sep 18, 2018 reply Follow Share Number of states needed in minimal finite automata is= 6/2 (1 state) +3= 4 states What is the answer? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes no of states in minimal finite automata =4 here it is mod 6= 6/2=3 here no of states = 3+1 Raghava45 answered Sep 18, 2018 Raghava45 comment Share Follow See all 0 reply Please log in or register to add a comment.