Pushdown Automaton to Context-Free Grammar Conversion Example

Publicado el: 09 noviembre 2020
en el canal de: Easy Theory

28,776

433

Here we give an example of the PDA to CFG conversion process. It starts by modifying the PDA so that there is a single final state, the stack ends empty, and every transition either pushes or pops but not both. Then we add Type I, II, and III rules. The first two only depend on the states, and Type III relies on finding "matching" transitions (i.e., a pair where one pushes a symbol x, and the other pops the same symbol x).

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

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

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

▶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.

En esta página del sitio puede ver el video en línea Pushdown Automaton to Context-Free Grammar Conversion Example de Duración hora minuto segunda en buena calidad , que subió el usuario Easy Theory 09 noviembre 2020, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 28,776 veces y le gustó 433 a los espectadores. Disfruta viendo!

350