Question

Can DFA simulate NFA?

Answer 1

DFA stands for Deterministic Finite Automaton. Its job is to read in a string of symbols (input) and move (transition) between its states based on the input and ultimately accept or reject the string of symbols. 

NFA is non-deterministic finite automaton. In an NFA:

In a state, for one input, the automaton can transition to more than one statesautomaton can transition using empty input

Answer 2

C program to simulate Nondeterministic Finite Automata (NFA) An NFA is typically described using a directed graph. ... The term 'non deterministic' means that at any state V we have more than one choice of following an edge. The NFA consumes the input string and set of states Q represents the possible moves of NFA.