Question

Prove that nfa and dfa both are equally strong language acceptor

Answer 1

Answer:

Explanation:

DFA = NFA. Two acceptors are equivalent if the accept the same language. A DFA is just a special case of an NFA that happens not to have any null transitions or multiple transitions on the same symbol. ... DFAs and NFAs define the same class of languages -- the regular languages.

Answer 2

Explanation:

➡️ DFA = NFA. Two acceptors are equivalent if the accept the same language. A DFA is just a special case of an NFA that happens not to have any null transitions or multiple transitions on the same symbol.DFAs and NFAs define the same class of languages -- the regular languages.