Context-Free Grammar (CFG) Example: Equal Pairs

Publicado el: 03 agosto 2022
en el canal de: Easy Theory

866

Here we make a context-free grammar (CFG) for the language of all strings of the form 0^n 1^n 2^m 3^m, where n, m are at least 0. Note that we have essentially the same problem twice, and both problems are adjacent to each other. Since m and n are independent of each other, we can just make a small CFG for each, and then put them together with concatenation.

Easy Theory Website: https://www.easytheory.org
Discord: / discord

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

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

The views expressed in this video are not reflective of any of my current or former employers.

En esta página del sitio puede ver el video en línea Context-Free Grammar (CFG) Example: Equal Pairs de Duración hora minuto segunda en buena calidad , que subió el usuario Easy Theory 03 agosto 2022, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 866 veces y le gustó 15 a los espectadores. Disfruta viendo!

2,474

106