when power feature non-determinism is added to finite automata then it is known as NDFA when an input is read the automata each step may chose to go to any of the several possible(legal) "next states " . Since the choice is not determined by anything , therefore , it is valled non deterministic.
Chat with our AI personalities
DFA - deterministic finite automata NFA - non-deterministic finite automata
DFA - Deterministic Finite Automata NFA - Non-Deterministic Finite Automata Both DFAs and NFAs are abstract machines which can be used to describe languages.
aop
if a language is recognized by NFA then it can also be recognized by DFA so we can simply say that NFA=DFA
Branches in the ICS organization may be