Simple Simplifications to PDAs (Force the Stack Empty!)

Publicado em: 05 Novembro 2020
no canal de: 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.

Nesta página do site você pode assistir ao vídeo on-line Simple Simplifications to PDAs (Force the Stack Empty!) duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário Easy Theory 05 Novembro 2020, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 5,596 vezes e gostou 123 espectadores. Boa visualização!

24,451

371