0 votes 0 votes Find the number of states in minimized DFA that accepts languages over sigma={a,b},where each string has exactly three a’s and two b’s. Theory of Computation finite-automata + – sandeep singh gaur asked Jan 22, 2019 retagged Jun 22, 2019 by Cristine sandeep singh gaur 1.2k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply OneZero commented Jan 22, 2019 reply Follow Share 13? 0 votes 0 votes sandeep singh gaur commented Jan 22, 2019 reply Follow Share 13 is Yes, I am getting 15 plz tell me 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes 5 state in exactly three a's and 4 state in at least two b After removing dead state we get 4 and 3 state So 4*3 = 12 and one for dead state total 13 state Zaman3027 answered Dec 3, 2019 Zaman3027 comment Share Follow See all 0 reply Please log in or register to add a comment.