Theory of Computation: Extended Transition Function for DFA with an Example

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

Рекомендации по теме
Комментарии
Автор

I have a doubt mam for dfa we have to show the transition for each input string like in the case of qo we have to show for 0 transition also.If we want we can not show in case of nfa but not in dfa beacuse the dead moves are only allowed in nfa not dfa

muskansingh
Автор

Your handwriting is clearn and beautiful, appreciate it!

zenanren
Автор

great job! thank you for explaning! Keep making these videos

clickbait
Автор

we won't use epsilon in dfa i think why u take epsilon

cheemulasuman
Автор

Thank you ma'am.
Nice explanation 🙏.

AvinashKumar-pbop
Автор

wow thank you so much for this! your explanation is good!

ferroumsamir
Автор

Thank You Anita R mam for ths nice explanation

sangdilbiswal