Want this question answered?
aop
It is the fifth letter of the Greek alphabet.
Yes, any NFA can be converted into an equivalent DFA. because there is an equivalence in between an NFA and DFA
in 1965 the NFA joined with FFA
Hi, 1. DFA cannot use empty string transition and NFS can use empty string transition. 2. It use one machine but it use multiple machine. 3. DFA is one state transition but NFA react according to some symbol.
Be more specific about what NFA you are talking about!
if a language is recognized by NFA then it can also be recognized by DFA so we can simply say that NFA=DFA
in 1965 the NFA joined with FFA
in 1965 the NFA joined with FFA
in 1965 the NFA joined with FFA
in 1965 the NFA joined with FFA
1. Every state of DFA always has exactly one exiting transition arrow for each symbol in the alphabet. In NFA a state may have zero, one or many exiting arrow for each alphabet. 2. NFA can use empty string transition but DFA can not use it.