Converting Non-Deterministic Finite Automata to Deterministic Finite Automata

By adding ambiguities to a finite automaton based on a regular expression, we show how to convert a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA).
Timestamps
00:00 | Intro
00:43 | Coin Toss Example Intro
03:47 | Transition Function Review
05:14 | Handling Undefined Transitions
10:30 | Handling Ambiguous Transitions
13:45 | Steps to Convert NFA to DFA
16:29 | Demonstrating Steps with Simple Example
22:24 | Demonstrating Steps with Another Example
Hashtags
#deterministic #finite #automata

[@octavalexandru1830]

aweosme video! however, i would like to see the epsilon transition being tackled

[@lucassandleris4486]

Thanks so much this helped me a lot... Such clear explanations!

[@ethernet764]

Learned a lot. Thanks!

[@y031962]

thanks so much for the clip; one question remains what is the final state where the output is 1 when condition is met. For example if {q0,q1} state is final; HTH will set the output to '1' and that is not what we want to see.

[@user-lx8mg5oj8e]

I am a student from China who has watched many videos until I found this one. It has helped me a lot… By the way, I was wondering if I could re-upload this video to Bilibili, which is the Chinese version of TH-cam. I will declare where the video is from and hope it can help more students.

[@Intermation]

Thank you so much for your kind words. I am so glad that the videos have helped you with your studies. As for uploading to Bilibili, I will look into it. Please do not upload my videos anywhere. Thanks!

[@user-lx8mg5oj8e]

​@@Intermation alright, I will respect your choice :) , Thanks for your awesome video

[@jenniferjoyce8463]

p͎r͎o͎m͎o͎s͎m͎