ฝัง
- เผยแพร่เมื่อ 25 ส.ค. 2024
- Technical lectures by Shravan Kumar Manthri.
Watch Top 100 C MCQ's
• Top 100 MCQs in C ("Wa...
Watch Technical C programming
• Technical C coding : p...
Watch Data Warehousing & Data Mining
• 1. Multi-Dimensional ...
Watch Design & Analysis of Algorithms
• 1. Introduction to the...
Watch Formal Languages & Automata theory
• 1. Introduction to Aut...
Contact me @ fb : shravan.kites@gmail.com
Like us on fb: CSE GURUS
This video explains DFA problems with explanation. #ShravankumarManthri#CSEGURUS #ShravankumarManthri#CSEGURUS
![fellow fellow - PROUD feat. INK WARUNTORN [STRING QUARTET]](http://i.ytimg.com/vi/BQrVkMPTdHE/mqdefault.jpg)
YOU are helping a lot to the students i am very much thankful to you.as well as god bless you&good luck
1:40:39 for rhs problem how you use input a for q1 to go to two states i.e., to q2 and q0 if it has two next states for 1 input then how it will be dfa?
One of the best lecture in youtube❤❤❤
Thank u very much.. u made my day...
Watch Turing Machine problems in the following link www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Really appreciated your work sir now i understood concept of DFA very thoroughly : ) thankyou sir!
Most welcome...Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Sir plz upload the video for NFA also it is so helpful .....and understood very well thank you sir.
We can read one day before the exam
Yes sir upload video on nfa also....
really such a good video i try to cover my DFA topic from last 22 days but i amunable to clear my concept but your video is aweosme
Very happy to hear from u..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
woah...what a teacher 🫡
Thank u...Watch Turing Machine problems in the following link www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
I am from ethiopia thank you for your clear explanation.
Most welcome and lots of love from INDIA.
Please Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Thank you very much Sir.Heartfull Thanks to you 😊. It will help all CSE students. I will share with my friends .
So nice of you...Please do share...You can watch this playlist for more stuff in C
th-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
@@CSEGURUS Yeah sure. 😊
Sir please upload for NFA also.
It will be helpful for us.
Great xplnation...
Thank u..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Very helpful, thank you sir! 🙏
Glad it was helpful..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Sir explanation is excellent 👍
Thank u very much..
Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Thank you, for that video sir !
Welcome..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Thank you so much sir
Most welcome...Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
thank you for the video
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?
Thank you sir for this video ..all the concept related to dfa problem is cleared ...a big thanks to u sir
Most welcome...Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Best video on this topic.
Thanks a lot..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
A great video! very helpful
Many thanks...
Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
good expain
Thank u..Watch Turing Machine problems in the following link www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
GUYS, it is a really good video to learn DFA problems based. it is really interesting, the more you listen the more you will like it. But do it parallel when he explains. Thank you sir so much...
Thank you for ur comment... Hope the viewers follow your suggestions...Keep Learning...
Exactly!!
If we practice these prblms we'll definitely get it...
And acc to me no one will explain as simple as like this.
Perfect✨ Thank you soo much sir
Most welcome...Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Very productive anf quality video lecture sir hope you go in the same way
Glad to hear and I will try my best..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Please make a video on NFA and €-NFA , mealy machine, moore machine also.
Thank you sir... Wonderful explanation
You're most welcome..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
excellent sir..thank u so much
You are most welcome..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
q0 must be the final state because in the language there is one case in which single ''b'' is there in ques 18
yes I was thinking of the same thing, it's strange no one pointed out
the explanation is amazing ............
Many thanks...Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Thank you so much sir, appreciated😊❤
So nice of you...
Tqu u sir for your clear explanation
You're most welcome..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
awesome explanation thank you sir
You are most welcome....
According to rule 1 st problem was wrong no need to create dummy state here min string is 2 then how 4 state will come..?? it should be n+1 states ...and in that qn it was not mentioned it was starting with any input symbol
Thank you sir... It helped me
Glad to hear that..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
30:10 sir idhar hum (aa) main left hand side wala (a) ko remove karka fear tu humra pass starting symbol (a) q1 aa sakta tha tu apna ya par dummy state kyo liye??
We cannot remove string from left hand side in this case...if it's not found we just put dummy state...we can remove only in the case string end with "abb" But not start with abb please notice the difference...hope you understand
Pls add discussion about language accept
Thank you so much 🙏
You're welcome 😊..
Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Appreciate your work, but one correction, in question 20, when you took the example of 2nd symbol from RHS, you made that one wrong, please check it again...
sir plz make a video on turing machine questions
Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Make q0 as initial as well as final state from q0 i/p is a, b to q1 from q1 i/p is b, a to q0
Is it correct for 1st question?
Thank you a lot sir thank you so much
Most welcome..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
tq
Most Welcome...Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Super 👌
Thank you..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
how do you do one over 3 inputs with a substring abc?
Awsm video brother with clear concept
Thanks a ton.. Keep Learning..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Wow! this is the right tutorial I was looking out for.
Glad it was helpful..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Sir plz explain about nfa also
Sir when should we put the reject state and in some cases you are returning it to initial when to use reject state please explain 🙏🙏🙏🙏🙏 requesting 🙏🙏🙏😭
1:33:35 In question no 18 what if we don't have any a
how to I construct a PDA for L={(a^nb^n)^m/n,m>0}
sir ur videos are perfect please make it visible .if it is not clear not getting intrest to watch
Thank you for ur feedback.. I vl do it for next videos..
In second problem why we made dummy state we can attach q2 to q4 with 0 and q3 to q4 with 0/1
There's a condition given in question...either 01 or 10
Wherever we've asked OR in question,we gotta take dummy state.
Sir can you please recheck the question of "a should be the 2nd symbol from Right hand side again??"
Yes.. Sir gave two transitions for 'a' at state Q1, it violates DFA rule
Sir plz upload the video for nfa also
I will do it in the next month.
1:32:27 what about "bb"
yeah, it's not even accepting only b
Sir can you please explain nfa
2/3 ka reminder 2 nahi 0 aata hai 39:56
can i get these questions as pdf format
sure.. u can ask me at csegurus@gmail.com
@@CSEGURUS ok check now
In Q.4 ending with aa=No ->a=q1 initial state
In Q.5 starts with aa=No->= q𝛟 null state
In Q.6 €.B=B substring of B=No-> q1 initial state
Useless logic
Sir, how we can do the table of transitions, i have not understood ?
question number 20 additional i.e accepting the 2nd symbol from RHS is 'a'. should it accept 'abab' string or not???
I think it's wrong cause it doesn't accept aab also
Q20 is becoming nfa
26:58,it will be from q3 to q1
12:13 it will be a b
Can you please explain how can we do :
Find a DFA that has i- position element as 0 and i+k -position element as 1 ?
Thanks 😊
what are the conditions for i and k?
can i get these questions as pdf format
Ask me at csegurus@gmail.com
done plzz check@@CSEGURUS