0 votes 0 votes Theory of Computation theory-of-computation finite-automata number-of-dfa + – Parshu gate asked Nov 5, 2017 Parshu gate 494 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply just_bhavana commented Nov 5, 2017 reply Follow Share 8 states ? 0 votes 0 votes Rishabh Gupta 2 commented Nov 5, 2017 reply Follow Share 11 states ??? 0 votes 0 votes Parshu gate commented Nov 5, 2017 reply Follow Share Yeah answer is 8 :) 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes I think i cover every string: Anu007 answered Nov 5, 2017 • edited Nov 5, 2017 by Anu007 Anu007 comment Share Follow See all 2 Comments See all 2 2 Comments reply LeenSharma commented Nov 5, 2017 reply Follow Share One production missing for the state 1 for the input symbol b. 0 votes 0 votes Anu007 commented Nov 5, 2017 reply Follow Share done :) 0 votes 0 votes Please log in or register to add a comment.