Deterministic Finite Automata ( DFA ) with (Type 2: Strings starting with)Examples

preview_player
Показать описание
This is the 2nd video of the new video series "Theoretical Computer Science(TCS)" guys :) Hope you guys get a clear understanding of this subject

Thank you guys for watching. If you liked it please leave a comment below it really helps to keep m going!:)
Рекомендации по теме
Комментарии
Автор

the guy who taught in the first tutorial was awesome...he was really good.

kumarchetan
Автор

8yrs later the video helping us out. Thanks for this masterpiece sir🙌🏾🙌🏾

Modrick_m
Автор

Don't forget two circles around q3!
Great video thank you!!!

jenweatherwax
Автор

Thank you. You explained the topic really clearly. Just a minor thing you forgot is showing the accepting and the start states in the transition diagram.

hamidmuzammil
Автор

Brother you are just awesome yarr, you just corrected my 3hr doubt in 7 min, love from maharashtra 🤞🤞

white_devil
Автор

I like the way you categorize the problems.

balol
Автор

Hi! Loved your videos, they were extremely helpful. I was wondering how to tackle a problem with the following reg expression c(aUb)(aUb)*b. I'm trying to follow your process but I get stuck how to write the table. Thanks!

galan
Автор

Superb tutorial. I'd love to learn till the end of this entire tutorial series.

spbe-xgqp
Автор

Were you said when" a"combines with" q1", making it "aa" ..
This makes it start from a and it's not supposed to be assigned to the rejected state "q¤"

erhumufelix
Автор

It's been 8 years since this video's but I hope you recovered from your cold quickly. ❤

funmilayobisola
Автор

thank you for teaching us DFA but in this video you forgot to encircle the final state and put an arrow to the initial state.. some students like me might get a deduction for it... small detail but might as well include it :)

harveybobila
Автор

can u give an example having more than 2 inputs ? it would be very helpful

yashikavarshney
Автор

it's Awsome to learn and pass my subject ...before that m blank regard to this subject. keep it up

sundasinam
Автор

man o man what a great way of teaching love this gb ....

anshuldhiman
Автор

Why didn't u use a reject in the type 1 ie. Strings ending with 100?

Zlatan..
Автор

Could you please upload topics of NFA (non deterministic finite automata), converting NFA to DFA, minimisation of DFA, E-transitions, Mealy and moore machines in Formal Language Automata Theory (FLAT) subject ...

gracegnancy
Автор

MAN, , I YOU YOU ARE AMAZING !! THANKS THANKS !!! I CAN NOT REPAY YOU BY MY LIFE EVEN

rehamahmed
Автор

Ideal method to find the logic easily, thank you 😊

preeyankasamim
Автор

Please upload the videos of DFA of even 0's and odd's and similar type of examples

harshilchheda
Автор

Good Technique. Very good for starters.
Keep it up

dr.anupambhatia