1 votes 1 votes no of states for accepting €? Theory of Computation minimal-state-automata + – Amey asked Dec 22, 2015 Amey 665 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes For $L=\{\epsilon \}$ In DFA, minimum no. of states required $= 2$ In NFA, minimum no. of states required $=1$ Praveen Saini answered Dec 22, 2015 • selected Dec 22, 2015 by Umang Raman Praveen Saini comment Share Follow See all 4 Comments See all 4 4 Comments reply अनुराग पाण्डेय commented Dec 22, 2015 reply Follow Share I have some doubt regarding number of states in the NFA here sir. Could you please give the NFA? 0 votes 0 votes Amey commented Dec 22, 2015 reply Follow Share why dfa have 2 states? plz explain 0 votes 0 votes Abhishekcs10 commented Dec 22, 2015 reply Follow Share for nfa simply make a state say q0 and make no transitions on alphbets (∑) and make it a final state. but for dfa as every alphabet needs a transition to be defined, it needs to have a trap state for showing transition of q0 on alphabets ∑ to the trap state say q1 . Thus for nfa 1 state and dfa 2 states 3 votes 3 votes Praveen Saini commented Dec 23, 2015 reply Follow Share DFA and NFA 4 votes 4 votes Please log in or register to add a comment.
