1 votes 1 votes Minimum number of states in a deterministic Finite automata that accepts the given language is ______ $L = \{ w \mid w \text{ is any string not in } a^*b^* \}$ Theory of Computation applied-course-2019-mock1 numerical-answers theory-of-computation finite-automata minimal-state-automata + – Applied Course asked Jan 16, 2019 • recategorized Jul 4, 2022 by Lakshman Bhaiya Applied Course 675 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes $L = \{ w \mid w \text{ is any string not in } a^*b^* \}$ $L'=\Sigma^* -L$ $L' = \{ w \mid w \text{ is any string in } a^*b^* \}$ DFA that accepts $L$ is Number of states are $3$. DFA for the given Language $L$ is Minimum number of states are $3$. Applied Course answered Jan 16, 2019 Applied Course comment Share Follow See all 3 Comments See all 3 3 Comments reply gmrishikumar commented Jan 24, 2019 reply Follow Share 'ab' is string which is in a*b*. So this string should not be accepted. But the given DFA accepts the string 'ab'. 0 votes 0 votes Ravi kumar singh commented Jan 24, 2019 reply Follow Share I am not sure but I think answer is 1. you can draw DFA of (a+b)* in one state and make that state as non final. A DFA can have 0 final states. 0 votes 0 votes mehul vaidya commented Jun 3, 2019 reply Follow Share this answer is correct. some correction needed . Assuming second diagram is for L' final states should be made non final and non final states should be final 1 votes 1 votes Please log in or register to add a comment.