Minimization of Deterministic Finite Automata (DFA)

preview_player
Показать описание
TOC: Minimization of Deterministic Finite Automata (DFA) in Theory of Computation.
Topics discussed:
1) Minimization of DFA.
2) Need for minimization.
3) Equivalence of states.

Music:
Axol x Alex Skrindo - You [NCS Release]

#TheoryOfComputation #TOCByNeso #MinimizationOfDFA #DFA #AutomataTheory
Рекомендации по теме
Комментарии
Автор

Thank you all the way from Greece, you have just helped me conduct a project which passes me my whole cemster lesson. Blessings to you and your family.

EndlessPanos
Автор

Oh god thank you man, my sincere thanks to you for teaching me this other method to resolve minimization of DFA, my teacher only showed me the filling method and i found that terrible and over complicated compared to this one, so you saved my semester <3

zanon
Автор

Thank you so much, Neso Academy! My classmates and I are learning so much through your tutorials. <3

michelleognita
Автор

You solve questions in the same way as our college teacher does... So if I miss any of my classes, then also mujhe tension nhi hoti... kuki I know ki aapke lectures dekhkr sb clear ho jata h 😊

rimikhandelwal
Автор

My savior thank you so much for providing such nice lectures

very helpful easy to understand with step by step examples

shan
Автор

Examn coming in 2 days, and somehow I ended up on your channel again <3

sehrgrossesglied
Автор

Thank God I found ur channel at the right time💘

Sn__Shorts_
Автор

Ur legend dood
Only because of you I'm going to clear my sem exam ❤️

AFTABALAM-inuu
Автор

00:02 Minimization of DFA reduces states
00:52 Minimize DFAs to reduce states
01:36 Minimization of Deterministic Finite Automata is possible through specific techniques.
02:20 Minimize DFA by combining equivalent states
03:04 Equivalence of states in DFA
04:00 Different types of equivalences for DFA
04:47 Equivalence of states based on string length
05:29 Equivalent states allow combining to minimize number of states.

Chirantank
Автор

Thank you much for uploading these fantastic

chenfeiyao
Автор

Thank you so much, Sir, Me and My classmates are learning so much through your tutorials. really amazing tutorials. thanks again.

abhinayjangde
Автор

your videos are very much helpful awesome. Hats off.
plz, make video on memory, ICs, A/D converter.
thank you sir!👍👌

cp-zhwm
Автор

I watched your all videos.. It's really awesome... All concepts are explained really well... Very nice

vratanttiwari
Автор

sir, these lectures were really awesome...I really thank you from the bottom of my heart for such an amazing playlist of tutorials../\

vishnunetha
Автор

i like this vedio so much to get knowledge in a perfect way

bhupalanagondi
Автор

Hello Sir. Why didn't use the extended transition function instead of the standard transition function? I think the standard transition function works only with elements in the alphabet but we are now talking about a string

kasozivincent
Автор

Nice Video Sir, I think at 4:10, for equivalence, conditions must be connected with AND and not with OR

KapilGuptathelearner
Автор

day after tmrw i have my sem exam and im watching ur vedios now...but bro ur videos are awsm ....man why we didn"t have lectures like uh today i completed 20 videos ...INSHALLAH it will help me in exam...

shamshadhs
Автор

Your lectures are awesome but please make lectures on economics for engineers and communication engineering

riyakumarishah
Автор

please it's a request upload all lectures . exams are coming near

kanishkrawat