Introduction to Pushdown Automata (Theory of Computing)
In today's lecture we explore a more powerful automaton than finite automaton, the pushdown automaton. We see the main ideas.
Time Stamps:
0:00 Opening, the big ideas and the concept of a stack
12:00 How do transitions work with a pushdown automaton?
18:15 High-level design of a pushdown automaton.
29:47 Definition of a pushdown automaton.
42:00 Closing
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Eric R
Patreon Supporters (Supporter Access!):
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: / pagewizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: / danielrpage
TWITTER: / pagewizardgle
QUORA: https://www.quora.com/profile/Daniel-...
TWITCH: / pagewizard
#ComputerScience
#theoryofcomputation
#automatatheory