0 votes 0 votes The minimum number of state in the DFA for the language $L = \{ w \mid w \in \{a,b\}^* \text{ w has exactly two a's and at least two b's} \}$ is $9$ $10$ $16$ None Theory of Computation theory-of-computation finite-automata minimal-state-automata + – Shivani gaikawad asked Jun 5, 2018 • edited Jun 5, 2018 by Subarna Das Shivani gaikawad 464 views answer comment Share Follow See 1 comment See all 1 1 comment reply Prateek Raghuvanshi commented Jun 5, 2018 reply Follow Share Is it 10 state?? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes As we can see there are two language ,one exactly two a's and other at least 2 b ,so in first lang after getting 2 a's , onwards 3rd a should not be accepted so there is trap state and for second after getting 2 b's ,any no. Of b's are accepted. Prateek Raghuvanshi answered Jun 5, 2018 Prateek Raghuvanshi comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes there will be 10 states in dfa Prince Sindhiya answered Jun 5, 2018 Prince Sindhiya comment Share Follow See all 2 Comments See all 2 2 Comments reply Deepak Poonia commented Jun 5, 2018 reply Follow Share Which are final states ? 0 votes 0 votes Prince Sindhiya commented Jun 5, 2018 reply Follow Share 9 is final state 0 votes 0 votes Please log in or register to add a comment.