lecture 18: non deterministic finite automata in hindi | DFA vs NFA | difference between dfa and nfa

non deterministic finite automata in hindi is 18th lecture of series theory of automata lectures in urdu. In this tutorial what is non deterministic finite automata is explained with the difference between deterministic finite automata and nondeterministic finite automata nfa (i.e. difference between dfa and nfa in automata in urdu ) non-deterministic finite automata is type of finite automata in which is defined by 5 tuples / parts like dfa; FA: {Q, Q0, F, ∑, ∂} Q: Number of States Q0: Initial State F: Final State ∑: Letters in Alphabet ∂: Transitions and some rules different from dfa 1. One letter can move to more than one state, next state is not determined 2. Dead End State is not required in NFA 3. Can move to Other state without any input there are so many people who search for following questions What is trap State? Can NFA have multiple final states? What is finite automata minimization? Why finite automata is called finite? and these all are answered in my series of theory of automata theory of automata is also named as theory of computation and theory of computer science and theory of formal languages and automata theory too, so if you want to learn non deterministic finite automata in any subject mentioned you can watch this video if you have any queries regarding difference between nfa and dfa or dfa vs nfa diagram (i.e. , difference between deterministic and nondeterministic automata ) in theory of automata / theory of computation toc, you can ask me in comments, I always reply to every comment. Thank you by: Ali Hassan Soomro Facebook: www.facebook.com/AliiHassanSoomro Gmail: [email protected]