4 votes 4 votes The minimal finite automata accepting the set of all strings over 0,1 starting with 1 that interpreted as a binary representation of an integer are congruent to 0 modulo 5 has ___ states. What is this language? Theory of Computation theory-of-computation + – gauravkc asked Jan 30, 2018 gauravkc 2.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply Ajay Jadhav commented Jan 31, 2018 reply Follow Share 7 states? for 6 divisiblity ,6 states and 1 dead state 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes I think answer is 6 rajatmyname answered Jan 30, 2018 rajatmyname comment Share Follow See all 16 Comments See all 16 16 Comments reply Show 13 previous comments braindead commented Jan 31, 2018 reply Follow Share sumit goyal 1 i think the question is only about of no of states, and gaurav is asking what the language is. 0 votes 0 votes sumit goyal 1 commented Jan 31, 2018 reply Follow Share your dfa accepting 0101 its not in language braindead 2 votes 2 votes niteen commented Aug 19, 2020 reply Follow Share your dfa is wrong it should be 5 states only 0 votes 0 votes Please log in or register to add a comment.
