1 votes 1 votes closed with the note: Wrong question Given : DFA. Minimum number of states required to construct an equivalent NFA is a)2 b)3 c)4 d)6 PS: how can we minimize if initial and final states of DFAare not given ? Theory of Computation theory-of-computation minimal-state-automata finite-automata + – shaurya vardhan asked Oct 24, 2017 closed Oct 24, 2017 by Habibkhan shaurya vardhan 905 views comment Share Follow See all 2 Comments See all 2 2 Comments reply Manu Thakur commented Oct 24, 2017 reply Follow Share As you can seen, o/p is associated with each transition, hence it's not finite automata, but it's a finite state machine either moore or melay, and a finite state machine doesn't have final states. post the exactly given question, and what is the source of this question?? 1 votes 1 votes shaurya vardhan commented Oct 25, 2017 reply Follow Share I copied the question as it is , it was from some test series , must be wrong .. but here is the thing .. given the FSM .. how can we design an equivalent NFA? 1 votes 1 votes Please log in or register to add a comment.