Pumping Lemma for Regular Languages Example: 0ⁿ1ᵐ, n != m (HARD!)

Publicado el: 01 enero 1970
en el canal de: Easy Theory

3,646

Here we do a very hard pumping lemma example of all strings of the form 0^n 1^m where n != m. The reason it is hard is given by the n != m condition, because to find a string to get a contradiction, we need to have the string of the form 0^n 1^n (i.e., same number of 0s and 1s). It's very easy to "miss" the two if the decomposition of the original string can be anything. That's why we use the "p factorial" method.

Easy Theory Website: https://www.easytheory.org
Discord: / discord

If you like this content, please consider subscribing to my channel: / @easytheory

▶SEND ME THEORY QUESTIONS◀
[email protected]

▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.

En esta página del sitio puede ver el video en línea Pumping Lemma for Regular Languages Example: 0ⁿ1ᵐ, n != m (HARD!) de Duración hora minuto segunda en buena calidad , que subió el usuario Easy Theory 01 enero 1970, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 3,646 veces y le gustó 45 a los espectadores. Disfruta viendo!

2,666