Pushdown Automata

Channel:
Canada PageWizard Games, Learning & Entertainment
Subscribers:
791
Published on ● Video Link: https://www.youtube.com/watch?v=tJJcNoTDEIE


Duration: 3:03:37
16 views
1

In today's lecture, we explore what happens when you give a nondeterministic finite automaton a stack! Be sure to tell your friends to come join the fun learning Computer Science!

I apologize for a few stutters in today's lecture, my foot was hurting at the time. It is unusual in my lectures to have small slip ups like that.

Time Stamps:
0:00 Preshow
17:28 Lecture begins

Fill out our form to learn more when we can help you learn computer science together live: https://forms.gle/ergL8FrbHuAHctF3A

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: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage

Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-...
TWITCH: https://www.twitch.tv/pagewizard

#ComputerScience
#theoryofcomputing
#automatatheory



Other Videos By PageWizard Games, Learning & Entertainment


2023-05-05Testing Emptiness of a Regular Language (Theory of Computing)
2023-05-03Reversal of a Regular Language is Regular (Theory of Computing)
2023-05-01Intersection and Set Difference are Closed Under Regular Languages (Theory of Computing)
2023-04-28Complement is Closed for Regular Languages (Theory of Computing)
2023-04-26Non-Regular Language with Equal Sums and More! (Theory of Computing)
2023-04-24Language with More 0s Before Less 1s is not Regular (Theory of Computing)
2023-04-21Dan Plays Chrono Trigger (April 20, 2023)
2023-04-21Language of Palindromic Strings is not Regular (Theory of Computing)
2023-04-19Language with Prime-Length Strings is not Regular [using Pumping Lemma] (Theory of Computing)
2023-04-19It's Poppin' Time!
2023-04-19Pushdown Automata
2023-04-17Tips on Using the Pumping Lemma to Prove Languages are Not Regular (Theory of Computing)
2023-04-14Caesar Cipher, Shift Cipher Cryptanalysis (Introductory Cryptography)
2023-04-14Dan Plays Chrono Trigger (April 13, 2023)
2023-04-12Shift Cipher (Introductory Cryptography)
2023-04-11Context-Free Grammars and Languages II
2023-04-10Cryptography: Basic Terminology, Communication Channel (Introductory Cryptography)
2023-04-07Application of the Pumping Lemma: Not All Languages are Regular (Theory of Computation)
2023-04-05The Pumping Lemma for Regular Languages [FULL PROOF] (Theory of Computing)
2023-04-03Pumping Lemma for Regular Languages: A Gentle Introduction (Theory of Computing)
2023-04-01Dan Plays Chrono Trigger (March 31, 2023 - Part 2)