1 votes 1 votes Consider a language over Σ={a,b} such that each string has at most two a’s and at least two b’s. The number of states in minimized DFA and number of final states are respectively. Parshu gate asked Jan 2, 2018 Parshu gate 389 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Anu007 commented Jan 2, 2018 i edited by Anu007 Jan 2, 2018 reply Follow Share I am getting 10 , 3 as answer 0 votes 0 votes LeenSharma commented Jan 2, 2018 reply Follow Share .......... 0 votes 0 votes Hamzahhh commented Dec 18, 2020 reply Follow Share It already minimize 0 votes 0 votes Please log in or register to add a comment.