Pumping Lemma for Regular Languages Example: 0ⁿ1ⁿ

[@HJHawley7677]

I’ve been watching so many videos trying to make sense of this and this is the first one that actually clicked. Thank you.

[@Jannick-l1k]

Holy shit these colors were so helpful for understanding the concept. I legit tried 10 different TH-cam videos to understand the Pumping lemma and yours is the first that actually got me pumping (haha, get it?).
Thanks a lot ❤

[@nguyentuan6108]

I believe you can grow more as creator. A lot of cool things from your videos. Thank you.

[@LotsOfFunyoutubechannel]

Very clear and understood it at once. Thanks

[@danydiab6120]

You are an angel! I love you

[@Xiaoxiaoxiaomao]

@Easy Theory
Excuse me Sir,
why |Y| >=1 ??
It must be greater than 0 according to the pumping lemma condition that is
|Y|>0

[@brynramirez917]

It’s the same thing, they both exclude 0. The next integer after 0 is 1 and 1>0 it it includes 1 and everything after that

[@Xiaoxiaoxiaomao]

@@brynramirez917
Thanks dear 👍🏻

[@eusebiupopescu-i2b]

Good job champ

[@aidencline7086]

Very helpful!

[@olivia_pouhela]

One Sentence = "God bless you😿"

[@farnazmzh5894]

Thank you

[@nollix]

WHY do you assume that xy is in the 0's?

[@hannahleah5875]

because otherwise |xy|>p

[@bc1k_]

HERO

[@Rawa0091]

نايس

[@jaishree701]

Why are you so handsome

[@BigTrev]

Control yourself woman