Theory of Computation: NFA to DFA conversion Example

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

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

thanks alot
most of the videos have only the easy problems
i was searching for this one

ZainabFatima-ny
Автор

Watching this before exam, Thank You Mam it was so easy

Abhishek-dffy
Автор

clear and percise explanation
thank you mam for this lectures'

mayank_m
Автор

Is it subset construction method? But in many other videos there is another method...?

freakofanupama
Автор

Camera focus is quite not interesting .

KumbarSharath
Автор

Thanks ma'am 😊 very well EXPLAINED

govindjangid
Автор

It helped me a lot in exams, thank you ma'am : )

kahanx
Автор

One mistake in q0, q1, q2, q3 on1 you just change the order so it makes the some wrong just check it again mam

harishr
Автор

BUT DFA SHOULD HAVE ONLY 1 INPUT RIGHT MAM ?

gowtham
Автор

Mam DFA transition table should represent using [ ] square brackets

Missnancyr
Автор

DFA states are only enclosed square brackets not a curly brackets.

manivannan
Автор

Camera man is playing with focus point 🤣

knownlearner
Автор

very clear explaination mam
very eas to understand
tnx mam

ichethan
Автор

Unga video paakrathu onnutha paakathathu onnutha.camera focus super ah iruku ponga

Iot_pro
Автор

Thank u so much mam 😍😍 your video helps me and my friends a lot

N.C.GIRISH
Автор

tapai ko fan vale may dd!! love from Nashville

anmolbaruwal
Автор

Mam in this example is use sub set method or not

mrsaeedk
Автор

Thank you so much but little error of camera just try to fix next time

nsrhfdhonlinetv
Автор

Mam but dfa means it should have single path but at last diagram 2 nodes have more than 1 path no?? Pls reply

balamurali
Автор

Thank u so much medam this video helps me lot ❤️

rekharekha