KonkurStudy
همه کارت‌ها

NFA to DFA: subset construction, epsilon-closure, and minimization

Convert any (epsilon-)NFA to an equivalent DFA whose states are sets of NFA states — then, if the question asks for the minimum number of states, minimize the result rather than reporting the raw subset count.

کارت الگوریتم کنکور ارشد علوم کامپیوتر