Context-Free Grammar (CFG) Example: Equal Pairs

Publié le: 03 août 2022
sur la chaîne: 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.

Sur cette page du site, vous pouvez voir la vidéo en ligne Context-Free Grammar (CFG) Example: Equal Pairs durée heure minute seconde en bonne qualité , qui a été Téléchargé par l'utilisateur Easy Theory 03 août 2022, Partagez le lien avec vos amis et connaissances, sur youtube cette vidéo a déjà été regardée 866 fois et il a aimé 15 téléspectateurs. Bon visionnage!

60,600

6.1K