Simple Simplifications to PDAs (Force the Stack Empty!)

Pubblicato il: 05 novembre 2020
sul canale di: Easy Theory

5,596

123

Here we make two adjustments to PDAs that we can always assume: that the stack is forced to be empty, and that every transition either pushes or pops, but not both. This is the start of the conversion from CFG to PDA, and allows the stack to change height by 1 on every transition. (Note that the "final" step at the end of the video is not complete because it has triple-epsilon transitions in it; see if you can "fix" it ;)

Easy Theory Website: https://www.easytheory.org
Become a member:    / @easytheory
Donation (appears on streams): https://streamlabs.com/easytheory1/tip
Paypal: https://paypal.me/easytheory
Patreon:   / easytheory
Discord:   / discord

#easytheory #gate #theory

Youtube Live Streaming (Sundays) - subscribe for when these occur.

Social Media:
Facebook Page:   / easytheory
Facebook group:   / easytheory
Twitter:   / easytheory

Merch:
Language Hierarchy Apparel: https://teespring.com/language-hierar...
Pumping Lemma Apparel: https://teespring.com/pumping-lemma-f...

If you like this content, please consider subscribing to my channel:    / @easytheory

Gold Supporters: Micah Wood
Silver Supporters: Timmy Gy

▶SEND ME THEORY QUESTIONS◀
[email protected]

▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.

In questa pagina del sito puoi guardare il video online Simple Simplifications to PDAs (Force the Stack Empty!) della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Easy Theory 05 novembre 2020, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 5,596 volte e gli è piaciuto 123 spettatori. Buona visione!