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

Pubblicato il: 01 gennaio 1970
sul canale di: 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.

In questa pagina del sito puoi guardare il video online Pumping Lemma for Regular Languages Example: 0ⁿ1ᵐ, n != m (HARD!) della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Easy Theory 01 gennaio 1970, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 3,646 volte e gli è piaciuto 45 spettatori. Buona visione!

4,093