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

[@zenanren4656]

Your handwriting is clearn and beautiful, appreciate it!

[@muskansingh4332]

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

[@clickbait1050]

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

[@sooryaprakash4481]

Thank u soo much ma'am 😊

[@sangdilbiswal30]

Thank You Anita R mam for ths nice explanation

[@AkGautam_1904]

Thank you ma'am. Nice explanation 🙏.

[@anamulhoque1947]

Nice explanation.

[@ferroumsamir6531]

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

[@cheemulasuman]

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

[@oreoshake5951]

It is same like.. When we have a single state and that state is start state as well as the final state. So what is the accepted value in it. Epsilon only. Hence taking epsilon is not a problem here.

[@codietech2806]

Thank you ma'am 😊

[@subhamjha8477]

thanks maam

[@pranavnkajanaya2379]

Thank you ma'am

[@akhileshh1675]

♥️

[@ritwikraj3716]

Nice explanation

[@darmudasir17]

Great

[@sindhugnanamuthu709]

Good explanation

[@jumaelahmed9995]

Thanks maam