2 votes 2 votes Theory of Computation finite-automata theory-of-computation + – Parshu gate asked Nov 5, 2017 Parshu gate 406 views answer comment Share Follow See 1 comment See all 1 1 comment reply Anu007 commented Nov 5, 2017 reply Follow Share answer will be 8 you forget to take trap state. 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes I Assume for $\sum$ ={a,b} Anu007 answered Nov 5, 2017 • selected Nov 12, 2017 by Parshu gate Anu007 comment Share Follow See all 2 Comments See all 2 2 Comments reply Parshu gate commented Nov 5, 2017 reply Follow Share Thank you :) 0 votes 0 votes Kaluti commented Nov 12, 2017 reply Follow Share answer will be 8 states including the dead state 0 votes 0 votes Please log in or register to add a comment.