Context-Free Grammar (CFG) Example: Non-Palindromes

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

2,083

Here we create a context-free grammar (CFG) for the set of strings that do NOT represent palindromes over {0, 1}. The trick with this language is that we know when a string is not a palindrome, namely when the same position from "either end" of the string is different, for some position. For example, 0100 is not a palindrome because two characters from either end give 1 in one case, and 0 in the other. To finish a CFG, we make characters from either end that are the same until we must (at some point) encounter a "bad" pair. After that (in the "middle") there can be literally any character.

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: Non-Palindromes 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 2,083 veces y le gustó 34 a los espectadores. Disfruta viendo!

2,474

106