Here we create a context-free grammar for the language {a^i b^j c^k : i != j}. The purpose of this example is to show how dealing with a "not equal" condition on the numbers of characters can be broken down to (1) the first is strictly less than the second, and (2) the second is strictly less than the first.
Easy Theory Website: 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.
Негізгі бет Context-Free Grammar (CFG) Example: {a^i b^j c^k : i != j}
Пікірлер: 6