{"type":"video","version":"1.0","html":"<iframe src=\"https://www.loom.com/embed/d32dfa783459432fa1d8160c882b7036\" frameborder=\"0\" width=\"1280\" height=\"960\" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>","height":960,"width":1280,"provider_name":"Loom","provider_url":"https://www.loom.com","thumbnail_height":960,"thumbnail_width":1280,"thumbnail_url":"https://cdn.loom.com/sessions/thumbnails/d32dfa783459432fa1d8160c882b7036-00001.gif","duration":525.078,"title":"NFA to DFA Conversion Explained","description":"In this video, I explain the process of converting an NFA (Nondeterministic Finite Automaton) to a DFA (Deterministic Finite Automaton). I start by discussing the importance of drawing a transition table for the given NFA diagram. Then, I demonstrate how to apply inputs to new states and combine them to create a DFA diagram. Finally, I explain how to identify the starting and final states in the DFA diagram. No action is requested from the viewers, but this video provides a clear understanding of the NFA to DFA conversion process."}