Difference between

Study of e-ccommerc
dfa and
Is nfa (A.I)
releva
nt
In deterministic finite automaton there is only one
path for a specific input from current state to next
exist. There is a unique transitin on each input
symbol. DFA can be understood as one machine.
Fuzzy crisp Is
DFA cannot use empty string transition.
Yes. DFA will
input. releven
reject the string if it end at other than accepting state.
tt
In non-deterministic finite automaton there exist
many paths for a specific input from current state to
next state. NFA can use empty string transition. NFA
can be understood as multiple little machines
Brandat the same time. If all of the branches of
computing
NFA Payment.
dies or reject the string, we can say that NFA
Membership funct
reject the string.
Site.
B2C

Fuzzification
 Name: Rimsha parvaiz
Roll no: 04
MCS
THEORY OF AUTOMATA
Submitted to: Sir Asfandyar