Pumping Lemma for Regular Languages Example: 0ⁿ1ⁿ

preview_player
Показать описание
Here we prove that the language of strings of the form 0^n 1^n is not regular using a standard application of the pumping lemma for regular languages.

▶SEND ME THEORY QUESTIONS◀

▶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.
  1. Easy Theory
  2. pumping lemma proof examples
  3. pumping lemma example
  4. pumping lemma examples for regular languages
  5. pumping lemma examples with solutions
  6. pumping lemma for regular languages
Рекомендации по теме
Pumping Lemma (For 0:08:08

Pumping Lemma (For Regular Languages)

What is the 0:05:11

What is the Pumping Lemma

Pumping Lemma (For 0:14:16

Pumping Lemma (For Regular Languages) | Example 1

Pumping Lemma for 2:21:21

Pumping Lemma for Regular Languages TWENTY Examples and Proof Strategies!

Nonregular languages: How 0:04:56

Nonregular languages: How to use the Pumping Lemma

Pumping Lemma for 0:11:48

Pumping Lemma for Regular Languages Example: 0ⁿ1ⁿ

Theory of Computation: 0:12:33

Theory of Computation: Pumping Lemma for Regular Languages

Pumping Lemma (For 0:08:38

Pumping Lemma (For Regular Languages) | Example 2

Pumping Lemma for 0:46:52

Pumping Lemma for Regular Languages FOUR Examples and Proof Strategies!

Lec-31: Pumping lemma 0:12:00

Lec-31: Pumping lemma for regular languages in TOC with examples

Pumping Lemma for 0:08:59

Pumping Lemma for Regular Languages with an example || Theory of Computation || TOC || FLAT

PUMPING LEMMA IN 0:16:39

PUMPING LEMMA IN AUTOMATA THEORY || PUMPING LEMMA FOR REGULAR LANGUAGES WITH EXAMPLES || TOC

2.15 Pumping Lemma 0:05:06

2.15 Pumping Lemma For Regular Expressions Examples Part-3 ||TOC|| FLAT

Pumping Lemma For 0:11:34

Pumping Lemma For Regular Sets

Pumping Lemma for 0:06:09

Pumping Lemma for Regular Languages Example: 0ⁿ10ⁿ

Pumping Lemma for 0:06:56

Pumping Lemma for Regular Languages: Example 1

Pumping lemma example|Pumping 0:03:58

Pumping lemma example|Pumping lemma|Pumping lemma for regular languages|What is pumping lemma

Pumping Lemma for 0:32:16

Pumping Lemma for regular languages with examples || prime || perfect square || balanced parenthesis

3. Regular Pumping 1:10:02

3. Regular Pumping Lemma, Conversion of FA to Regular Expressions

Theory of Computation: 0:05:29

Theory of Computation: Pumping Lemma-Example2

Pumping Lemma for 0:08:39

Pumping Lemma for Regular Languages || Lesson 50 || Finite Automata || Learning Monkey ||

Pumping Lemma for 0:04:17

Pumping Lemma for Regular Languages PROOF IN 4 MINUTES - Easy Theory

PUMPING LEMMA FOR 0:11:53

PUMPING LEMMA FOR REGULAR LANGUAGE FOR STRING LENGTH PRIME NUMBER

Pumping Lemma for 0:09:51

Pumping Lemma for Regular Language | CST301 | FLAT MODULE 2 | KTU | Anna Thomas | SJCET

Комментарии
Автор

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

HJHawley
Автор

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

Thanks a lot ❤

Jannick-lk
Автор

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

nguyentuan
Автор

@Easy Theory
Excuse me Sir,

why |Y| >=1 ??

It must be greater than 0 according to the pumping lemma condition that is
|Y|>0

Xiaoxiaoxiaomao
Автор

Very clear and understood it at once. Thanks

LotsOfFunyoutubechannel
Автор

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

nollix
visit shbcf.ru