Context-Free Grammar (CFG) Example: Equal Pairs

Published: 03 August 2022
on channel: 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.

On this page of the site you can watch the video online Context-Free Grammar (CFG) Example: Equal Pairs with a duration of hours minute second in good quality, which was uploaded by the user Easy Theory 03 August 2022, share the link with friends and acquaintances, this video has already been watched 866 times on youtube and it was liked by 15 viewers. Enjoy your viewing!