00:12 Different types of finite automata: DFA and NFA 02:07 Finite automata involves transition functions and state transitions. 03:55 Finite automata have only one path for each state transition with the input symbol. 05:37 Finite automata can have multiple paths and transition functions vary. 07:14 Cross product of symbols with states gives next state from power set of queue 09:11 NFA allows for multiple paths for one input symbol 11:04 DFA and NFA have differences in transition functions and empty transitions 12:57 DFA and NFA have differences in dead states, transitions, and transition functions
What a teaching sir... Really very good explanation of each steps in details. Easier to understand...
Thank you so much sir....
Excellent explanation on every topic. It was really helpful in my study. Thank you sir👍
చాలా బాగా చేస్తున్నారు నేను మీ ఛానల్లో పైతాన్ నేర్చుకుంటున్నాను థాంక్యూ
Sir please try to tell about computer organization and architecture
really great sir you gave step by step explanation😇😇💥💥
The way of teaching soo good sir . Excellent 💥💥
Excellent teaching.
Thank you very much sir ❤❤
NICE SUPER EXCELLENT MOTIVATED
Excellent explanation sir
Thank you sir❤
00:12 Different types of finite automata: DFA and NFA
02:07 Finite automata involves transition functions and state transitions.
03:55 Finite automata have only one path for each state transition with the input symbol.
05:37 Finite automata can have multiple paths and transition functions vary.
07:14 Cross product of symbols with states gives next state from power set of queue
09:11 NFA allows for multiple paths for one input symbol
11:04 DFA and NFA have differences in transition functions and empty transitions
12:57 DFA and NFA have differences in dead states, transitions, and transition functions
Good explanation sir
Can you please say me this answer sir .
Construct a finite automata for the regular expression 1(01+10)*00
Sir what is dead state?
Thankyou sir.It is very useful
super sir it is very useful
Thanksssssssss😢😊
Sir how to draw states using inputs?
Sir please explain about dead state
What is it?
please more explanations on q0 -> q0 and q0 -> q1
4:`7 i dont understand what do you mean by one path. Is it that when 0 then stays and if 1 then q1 thjen thats it?
Good
Not all hero's wear cape
What is dead state
Yes what is it?