Context-Free Grammar (CFG) Example: Equal Pairs

Pubblicato il: 03 agosto 2022
sul canale di: 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.

In questa pagina del sito puoi guardare il video online Context-Free Grammar (CFG) Example: Equal Pairs della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Easy Theory 03 agosto 2022, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 866 volte e gli è piaciuto 15 spettatori. Buona visione!

2,666