0 votes 0 votes Theory of Computation theory-of-computation finite-automata + – Prince Sindhiya asked Jun 6, 2018 Prince Sindhiya 350 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes To be sure of correct answer, better first convert the given NFA into equivalent DFA and then minimize (if required). Here, The number of states in Minimized DFA will be = $6$ States Deepak Poonia answered Jun 7, 2018 Deepak Poonia comment Share Follow See all 4 Comments See all 4 4 Comments reply Prince Sindhiya commented Jun 12, 2018 reply Follow Share I am getting this minimised dfa then after minimization 0 votes 0 votes Prince Sindhiya commented Jun 12, 2018 reply Follow Share How 2,3,4 are merged ? 0 votes 0 votes Prince Sindhiya commented Jun 12, 2018 reply Follow Share I got this table 0 votes 0 votes Deepak Poonia commented Jun 12, 2018 reply Follow Share How 2,3,4 are merged ? Because of $\in \,\,closure$ of state $1$ on $a$. I got this table Please verify..some mistake is there. 0 votes 0 votes Please log in or register to add a comment.