DFA Examples 5 & 6 || Set of all strings ends with ab || ends with 00 || FLAT||Theory of computation

preview_player
Показать описание
Plz Subscribe to the Channel and if possible plz share with your friends. Thanks in advance

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

Aftet mht-cet you are the one teacher for whom i feel conneccted after dinesh sir. Love you sir😊😊😊

rode_atharva
Автор

sir, in question ending with ab, cant we give a self loop of a, b to q2 instead of bactracking a to q1 and b to q0

vinyachowdary
Автор

i clarify my all doubt by seeing your videos 😇 thanks you sir❤

Magicwithmathematics
Автор

Thanks for the explanation. I have a question, for the second example, can I take a transition of 1 from q2 to q1 instead of q2 to q0, cause to q1 we can still have as many 0's as we want because of the loop applied on q2. Correct me if I am wrong, please.

Muna-dxly
Автор

Thankyouu soo much sir I searched many videos i did not understand by seeing this video i got clarity sir

bodankimadhukiran
Автор

Why we not connected final q2 state 1 input to q1 ?

rajasekharreddy
Автор

Sir in DFA string ending problem we can take dummi state please reply me

deepusurampalli-ecyt
Автор

Sir last sum last step lo q1 nunchi q0 ni 1 icharu enduku sir q0 nunchi q2 ki ivachu kadha

himabindukannepalli
Автор

Sir ending with ab abab and baab are two diffrent or same

hexitsok
Автор

Sit can we take self loop at q1 in ending with '00' problem without taking transition to q0

vipuldudyala
Автор

Sir in my book we have 5 states taken and q4 is final state

PSEUDObrucelee