2 votes 2 votes Which of the following represent the minimum no. of states in DFA which accept all string of length atmost 5 ‘a’? 6 4 5 7 Answer given in 5 , how possible ? atmost 5 a means , on seeing 6th a , we should send it to a dead state right ? so , won't it be 7 states ? Theory of Computation theory-of-computation + – worst_engineer asked Jan 14, 2016 worst_engineer 564 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes 7 is the correct answer 6 final states + 1 dead state priyavssut answered Jan 14, 2016 • selected Jan 14, 2016 by Praveen Saini priyavssut comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes It must not allow 6th a 5th 'a' itself must take you to dead state. Answer is 7 as we consider one dead state. sarvani videla answered Jan 14, 2016 • edited Jan 14, 2016 by sarvani videla sarvani videla comment Share Follow See 1 comment See all 1 1 comment reply worst_engineer commented Jan 14, 2016 reply Follow Share please correct me if i am wrong. atmost 5 means 0 , 1, 2, 3, 4 , 5 , right ? 0 votes 0 votes Please log in or register to add a comment.
