Pushdown Automata (Introduction)
Вставка
- Опубліковано 6 вер 2024
- TOC: Pushdown Automata (Introduction)
Topics Discussed:
1. Introduction to pushdown automata(PDA)
2. Difference between pushdown automata and finite state machine
3. Stack in pushdown automata
4. Push and pop operations in stack
5. Components of pushdown automata
Contribute: www.nesoacademy...
Website ► www.nesoacademy...
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Pinterest ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
• Axol x Alex Skrindo - ...
Exam tomorrow !
You have no idea how much I appreciate these videos. Thank you.
i know Im randomly asking but does any of you know a trick to get back into an Instagram account??
I stupidly lost the login password. I appreciate any assistance you can offer me
@Milan Omari instablaster =)
@Leroy Bishop i really appreciate your reply. I got to the site on google and I'm waiting for the hacking stuff now.
I see it takes a while so I will get back to you later when my account password hopefully is recovered.
@Leroy Bishop it did the trick and I finally got access to my account again. Im so happy:D
Thanks so much you really help me out :D
@Milan Omari No problem :)
My professor for this course is probably the hardest to understand I've had so far, thank you so much for making this material accessible and easy to understand, I don't think you can begin to imagine how helpful and appreciated you are
Thank You.... You are doing GREAT work..... Some people are very even not able to purchase books....and NESO Academy is the only one who help us.....You work make BIG IMPACT on world.... You will feel proud when your children and grand children will talk about NESO Academy..... These videos will help students more than 500 years people will remember you about your work
Take Care
7 min of video , But the knowledge of entire semester , #Respect #thank you
true
3.5* 🤣😂
Your voice and way of teaching is really very nice.
I had so many doubts in toc and my teacher was not able to solve my doubts so i had no other option but to look for online lectures. your video came at the top of my search and i just started watching and immediately i subscribed and binged watch your videos. thank u for making me understand toc as its my weakest subject. and am totally promoting your channel in my friend group
wordless to speak about the lectures... I couldnt believe that this type of high quality lecture videos are just absolutely free of cost....Hats off!!
Sir, you r doing a great job towards the humanity. That means quench the thirst of knowledge those who are not capable of paying huge amount to it.
Hates of to you.May God bless you.
Sir, I tried to find a-z of CSC by NESO Academy but I couldn't found it. Or you don't compose videos for cs branch.
sourav dutta LOL it’s Hats not HAT’s
Thank you, your lectures are so helpful :)
Yu r so amazing... i have a final exam in 2 days n i didnt know what z hell was going on until i see yu lol... yu just saved me 😃thank yu❤❤
excellent job ,sir . you're the genius man. thank you
Loved your explanation as you make everything simpler
00:00 Pushdown automata is a way to implement a context-free grammar
00:52 Pushdown automata is more powerful than Finite State Machines
01:50 Pushdown automata have a stack for infinite memory that makes them more powerful than a finite state machine.
02:44 A stack has two basic operations: push and pop
03:37 Push and Pop operations on a stack
04:32 Stack data structure has two main operations: push and pop
05:25 Push down automata has 3 components
06:17 Introduction to Pushdown Automata
Your channel is like a God or master key for students like us, you are just the best neso
You are breath taking
bole to logic full to clear ho gya boss
Thank you sirji
Thank u so much sir ur videos help me a lot and I have learnt lots of things abt the theory of computation and finite automata through this videos .Now I have confidence to say that I knw what is unit 3 of B.Sc math...thanks a lot
what is that
Your way of teaching is amazing❤💗💖
Thank you so much.. you explain more in these 3 video then my last 6 lectures..
Could you please make a Video about Linear Bounded Automata ?? No one explains the things in the way you do !! Thanks a lot
man i love neso academy
I am seeing this after 4 years this is really helpful
Hi!! I have an exam in the mathematical theory of computing soon, and I don't know how to solve some tasks from the homework related to context-free languages, PDA, recursive relations and the Turing machine. Can you solve some of the tasks for me? Thank you
Thank you
Love you soo much 💞 sir for this type of explanation ❤
This is great channel
Tq for providing the all videos regarding Flat.
understanding levels tqsm sir
thank u so much sir ,i passed flat sub because of u sirrr
Sir i understand all of your explanations but why do we use , a pda is not clear to me , i don't understand the implementation of pda or FSM for that matter , what is the purpose of , knowing if the input string can be accepted or not , like what is the output that we get
Thanks for the video
Thank you so much
i like you, such an amazing introduction
very easy to understand
great lecture videos
My Whole college classmate depends on your videos 😂😂
excellent video, thanks a lot
Thank you..
Thanks sir
Do you guys have the full course on Udemy perhaps?
Thanx a lot for your efforts.. just got one request why don't you give us the slides that you write it gets more catchy when we will see them.
I don't understand what is meant by accepting the strings actually , i mean i know the processing but what isnthe purpose of that processing of the string input , as in our computer we give input a code for addition and then the computer accepts it and gives output as sum , so what is the output after a pda accepts a input string
excellent sir
Sir please made playlist on communication system🙏🙏😇
I love neso.
good job
Respect 💯
great work
Great video ❤️💋
very useful
amazing video :)
true legend
While watching the video, it would be better if we could find the no of the video somewhere, we tend to lose count.
Can we pls get notes as well??
PDA is more powerful than FSM, one of the main reason is that it has a stack associated with it 🤟
nice video
From where the neso academy is running
bro i love you vids men you explain better than my fuckin teacher who i pay 3k a year
how to I construct a PDA for L={(a^nb^n)^m/n,m>0}
I have connective topic vedio anna pls send
Why am I hearing Assamese accent 😢
Itiya tumi jetu mention korila, now I can't unhear it😂
vadham
infinite is read infenet not infynyte
Jackson Helen Walker William Clark Christopher
Construct the PDA for Following HTML tags -- content area---
Please help me to solve this
I understand that video length is very important, but its really annoying how many times you repeat your self.
nanm ileda koppa
hey poochie
:*
Sorry it was hat's off not hates off, I apologize for the spell mistake.
Sorry.....
you know you can edit your comments, right?
Let him breath boy
I have exam in 30 mins 😂😂😂
Pass kaise hona hai automata ma. Bataoo koi. 🤣🤣🤣🤣🤣🤣
sir can you solve this example for me? { a^n a^b : n , m >=1 }
Sir ko assignment hi send kar na . 9987643267 Sir ne mera bhi solve kiya tha
is that his actual no.?
thank you
Thankyou sir
thanks Sir
Thank you