finite automata | TOC | Lec-6 | Bhanu Priya

[@BusinessBlazeIndia]

can you provide the written notes as well dear
your teaching is superb but it will be a helping hand if we get pdf of your notes for reference
because it will save our time .

[@samirhusain1685]

Ma'am your voice is so sweet ! 😇

[@fayazshaik7915]

Ahaaa 😂🤣

[@MattaparthiShivaBhargav]

+5 marks

[@yeswanthshiv6898]

Abba Kamal hassan

[@aryasarkar3514]

Bhai thoda padh liya karo
Mam ke sath flirt nahi karte

[@udaynarasimha1234]

Abe padayi likhayi karo

[@edwintan4784]

Thanks for your efforts, madam! Your teaching is very clear !!

[@sajitmanandhar3161]

Great video mam ....keep on uploading videos

[@ganeshgopalg3354]

Much more better than our teacher

[@mustapharaimilawal8053]

Thank you for making this video, very clear explanation.

[@divyrajverma8286]

Thank you so much mam for clearing my concept ❤🔥❤🚩

[@bhargabray3]

Can you suggest some beginner level book for theory of automata ?

[@shaliniwalia6162]

Mam your teaching style is fantastic but I have a doubt can a finite automata have more than one final states ,can you give an example of finite automata with two or more accepting state ,how final states can be more than one

[@akashvarma8144]

I'm not some expert but if you want an example for multiple final states then
Make a dfa which takes either empty string or odd number of characters in a string and nothing else

[@yogithasree006]

Great explanation mam❤

[@djketul_77x]

Thank you ma'am 🙂

[@vs.swetha]

i can able to understand very easily mam

[@MuhammadRizwan-xv6wr]

Thankss Mam

[@anyinfo3939]

Back tracking means... ?
And when we use apsilon in nfa

[@Onedayabanker]

Thanks you and very well explain mam

[@priyankamandal5152]

Very well explanation🤗

[@targettech.d1549]

Mam nice explanation ❤️

[@daibimoitra1999]

first three u wrote with this sign :
4th one was belongs to
5th one was subset symbol
ma'am can you explain that part please

[@farwahbatool6247]

Q is a state. There can be more than two states. States can be named as q0, q1, q2, ... and so on. A machine has always got a single "initial state", which is the q0. Therefore, q0 'belongs to' Q (which means that q0 is a state Q).
F is called as "the set of accepting states". Why? Because there can be more than one accept/final states. Now, similar to the above explained concept, F is a state Q. For example, there could be five states (Q) namely, q0, q1, q2, q3, q4. q0 is the start state. q2 and q4 could be accepting/final states. These states are Q, remember? That is why, final state(s) are the subset of states Q.
I hope you have got this concept now :)

[@daibimoitra1999]

@@farwahbatool6247 thank you maam

[@cs_soldier5292]

Madam please make it as a playlist

[@Aadarsha3]

finite state automate is a finite state machine without output

[@Terminator0512]

Thank u

[@samiroraon5808]

Mam Are you teaching or studying by own ?

[@md.shafaatjamilrokon8587]

Thanks

[@atkuriajaykumar3701]

thankyou madam

[@knowledgeaboutworld754]

Woh seeing this video 3 hours before Exam???

[@sureshpeparla365]

Thanks🙏🙇 mam

[@gsranju]

Thank you madam all subject video please

[@lokeswarmamallan5373]

0191K43SHARESAVEEducation 4u527K subscribersfinite automata in theory of computation26 Comments

[@Abcd-m4z6l]

i think it should be tuple not tuples

[@dohertyuag]

Can you please not use sketch pens? That sound irritates me.
Nice explanation :)

[@Onedayabanker]

Love you mam

[@vamsibattula5333]

No proper info

[@animelife9351]

Why Everyone Saying That Thank You To this Madam. If you Clearly Observer that Video, She Just Read and repeat middle of words what they wrote in there book. There is nothing explained it. They just read that page. 😠😠

[@yoyashuyo3485]

Yes you are right bruh, I think people here were thirsty and not came here for knowledge.

[@vikassatyam4560]

Jab padhana nehi aye naa kuch chillar paiso ke liye videos maat dal.. Aur zyada time waste hota hain

[@sravanilakshmi2433]

Thank u mam