CONVERSION OF NFA TO DFA WITH EXAMPLES IN AUTOMATA THEORY || NFA TO DFA CONVERSION || TOC
ฝัง
- เผยแพร่เมื่อ 18 ต.ค. 2021
- INTRODUCTION TO AUTOMATA THEORY AND ITS APPLICATIONS || THEORY OF COMPUTATION || FORMAL LANGUAGES
• INTRODUCTION TO AUTOMA...
BASIC NOTATIONS & REPRESENTATIONS IN AUTOMATA THEORY || BASICS OF AUTOMATA || THEORY OF COMPUTATION
• BASIC NOTATIONS & REPR...
WHAT IS FINITE AUTOMATA AND REPRESENTATION OF FINITE AUTOMATA || THEORY OF COMPUTATION
• WHAT IS FINITE AUTOMAT...
TYPES OF FINITE AUTOMATA (DFA & NFA) IN AUTOMATA THEORY || DFA & NFA || THEORY OF COMPUTATION
• TYPES OF FINITE AUTOMA...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 1 (STRINGS STARTS WITH) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 2 (STRINGS ENDS WITH) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 3 (SUBSTRING OR CONTAINS) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 4 (STRING LENGTH) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA EXAMPLE - 5 (DIVISIBLE BY) IN AUTOMATA THEORY || THEORY OF COMPUTATION
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 6 (EVEN'S & ODD'S) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
NFA (NON DETERMINISTIC FINITE AUTOMATA) WITH EXAMPLE IN AUTOMATA THEORY || THEORY OF COMPUTATION
• NFA (NON DETERMINISTIC...
NFA (NON DETERMINISTIC FINITE AUTOMATA) WITH EPSILON IN AUTOMATA THEORY || NDFA || TOC
• NFA (NON DETERMINISTIC...
DIFFERENCES BETWEEN DFA & NFA IN AUTOMATA THEORY || DFA & NFA || THEORY OF COMPUTATION
• DIFFERENCES BETWEEN DF...
EPSILON CLOSURE IN AUTOMATA THEORY || NFA WITH EPSILON || TOC
• EPSILON CLOSURE IN AUT...
CONVERSION OF NFA WITH EPSILON TO NFA WITHOUT EPSILON IN AUTOMATA THEORY || TOC
• CONVERSION OF NFA WITH...
My professor thought this course in masters, but I couldn't understand properly, but your explanation makes my all doubts very clear, and thank you so much for explaining two different examples :)
now that i got started studying engineering i finally understand all those memes about indian youtubers getting western kids through college. its true, all of it. bless you
your videos are so clear and simple, and the examples are also great and easy to understand! Thank you so much for sharing your knowledge with us!
Really appreciated ☺️👍 Thanks sir!!
Thank you sir, your videos are soo useful for mee...
Sir ur a God, i have vtu Atc exam tomorrow and im watching ur videos now
Great job man made my day wonderfull.
Sir great teaching !!!!!
Sir please take class of Excel completely... I easily understand your teaching thank you sir..
tqsm sir for playlist
outstanding sir perfect explanation step by step 😍😍😃😃💥💥💥🙏🙏
your teaching is very very nice sir
In the second example what happened to q1 and q2 ?
q2 and q0?
Thank u sir🙏🙏🙏💯
Thank you so much sir
thank you so much
Thank you sir 10 marks today
Nice explanation 💯
super sir
Hi sir... How we have to use scanner method for all concept in Java programming
Tnku sir❤
TQ sir
sir could you please make more videos on conversion of NFA to DFA
sir, you considered q0 as initial state and also as a final state? in the second example.
because it is already given in the question itself that q0 is initial as well as final state
In 2nd example q2 state not written, why?
Whether final state in nfa and dfa are same
sir in 2nd example how can u say the final state
The state which has arrow mark towards that state will be considered as initial state and the state which has double circle will be considered as final state.
👏
how comes we have states with 2 names
it would be more easy by using the table
In the first example q1 is not a new state then y we need to find its transition
❤❤
In second what happen to q1and q2
Same question bro
questions are not visible!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
decrease the Ads inbetween the video 😡😡😡😡