3. Types of Finite Automata and Language acceptance

[@youknowmyname9606]

Thank you very much sir 🤩👍💯
We need more teachers like you

[@CSEGURUS]

It's my pleasure...
Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

[@sammyt8802]

Thank you sir,you made the subject too easy.🥰 LOVE and Respect for this people😎

[@CSEGURUS]

Many Thanks and most welcome...
Watch Turing Machine problems by contributing in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

[@shivamtiwari5366]

Great lecture sir
You have my respect sir🙌

[@CSEGURUS]

Very glad to hear..
Watch Turing Machine problems by contributing in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

[@omkarnale5879]

great video sir .....understood the concept

[@CSEGURUS]

Glad to hear that....Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

[@nageegundala1142]

Sir, first diagram 011 not accepting but 10011 is accepting how ,sir, if 011 not accept 10011 also not accept know, i have doubt.

[@ecomad9]

Thank you sir. Still bit confusing to get common language to a certain NFA

[@srinithi9510]

q not0 how will come qnot o and q1 how will come q0 sir

[@mimnehmimneh4760]

tnx man

[@srinithi9510]

cant understand input and output say and give sir

[@ElifArslan-l9g]

thank you

[@CSEGURUS]

You're welcome...Watch Turing Machine problems by contributing in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

[@nageswararaogali8638]

NFA is equivalence to DFA.I have confuse every DFA is also an NFA.but not vice-versa.

[@CSEGURUS]

In one way every DFA is also an NFA, as NFA has no rules on transitions from one state to other state.Thatswhy every DFA we call it as NFA.
where as DFA has rules on transitions and NFA mostly doesnot follow those rules so every NFA is not DFA.
But you can convert an NFA into DFA by arranging those rules.

[@jeanv6410]

8ㅅ8 where is caption.....!

[@er.abhishekgupta195]

How to get pdf?

[@CSEGURUS]

pls ask me at [e-mail]

[@uzmakouser2268]

Wch textbook nd author u use sir

[@bereketkibret122]

for the first Question diagram 10 is not final state bro ok

[@throwawayaccount5464]

You are god man thank you I was reluctant to study this piece of shit subject

[@CSEGURUS]

You are most welcome and Thank u...
Pls Watch Turing Machine problems in the following link www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

[@srinithi9510]

reply to me sir