0 votes 0 votes closed with the note: dulicate question Number of states in MFA that accepts all the strings of a's and b's where each string contains atmost 5 a's and atmost 6 b's is..... rtiwari95 asked Dec 10, 2016 closed Dec 27, 2016 by rtiwari95 rtiwari95 482 views comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments rtiwari95 commented Dec 10, 2016 reply Follow Share incorrect answer correct answer is 43 , but I don't know how ? My answer is 42 0 votes 0 votes srestha commented Dec 10, 2016 i edited by srestha Dec 11, 2016 reply Follow Share yes, 43 states , because last 1 reject state 0 votes 0 votes Sarvottam Patel commented Dec 10, 2016 reply Follow Share It will be 43 state because one dead state is required 0 votes 0 votes Please log in or register to add a comment.