How to Convert NFA to DFA: Dealing with Epsilon Transitions

Показать описание

All DFAs are NFAs, but not all NFAs are DFAs. How can we convert an arbitrary NFA to an equivalent DFA? This video shows how to deal with epsilon transitions during this conversion.

Mohammad T. Irfan

Рекомендации по теме

Комментарии

cleanest and the clearest explanation even covers starting with an epsilon transition

ODAKAB

WOW! perfect! the clear and consice explanation added with the amazing visuals, audio pacing being constant + composition and your way of covering a bunch of concepts within one example is perfect! loved it! Thank you!

abenezertasissa

should {g, f} not be {g, f, s} because u can go from a to s through epsilon.

MuhammedCheema-sllp

Great video brother, please keep it up

Iqbal

Appreciate your clear explanation. Please continue making Computer Theory videos, such as converting regular expression to NFA and vice versa. Also, didn't mean to point this out, but because we are building DFA at the end, shouldn't our DFA have trap states? Anyway, thank you for your video, sir.

ngocchaunguyen

shouldn't DFA cover all of the transitions(0 and 1)? g and g, f doesn't have any transitions

victorliu

Amazing video, jazakAllah Khair for clarifying epsilon transition

EzzzZZZ___

State (g, f) can be omitted, and the 0, 1 transition can be from (a, s, f) to itself. I'm not sure how you got the state (g, f) in the first place, given there are no forward epsilon-transitions (indeed, no forward transitions at all) from state (g) or state (f) in the NFA.

Essentially, if a newly created DFA state is a subset of any of the others, it doesn't need to be included.

kyrrodi