[Mathematical Linguistics] Pumping Lemma for Context Free Languages

preview_player
Показать описание
Talk about the Pumping Lemma for Context-Free Languages (CFLs) and show that a^nb^nc^n is not context-free.

LIKE AND SHARE THE VIDEO IF IT HELPED!

Hello, welcome to TheTrevTutor. I'm here to help you learn your college courses in an easy, efficient manner. If you like what you see, feel free to subscribe and follow me for updates. If you have any questions, leave them below. I try to answer as many questions as possible. If something isn't quite clear or needs more explanation, I can easily make additional videos to satisfy your need for knowledge and understanding.
  1. TrevTutor
  2. pumping lemma
  3. pumping lemma for context free languages
  4. pumping lemma cfg
  5. pumping lemma cfgs
  6. cfg pumping lemma
Рекомендации по теме
[Mathematical Linguistics] Pumping 0:13:42

[Mathematical Linguistics] Pumping Lemma for Regular Languages

[Mathematical Linguistics] Pumping 0:09:26

[Mathematical Linguistics] Pumping Lemma for Context Free Languages

Pumping Lemma (For 0:08:08

Pumping Lemma (For Regular Languages)

What is the 0:05:11

What is the Pumping Lemma

Discrete Math - 0:25:46

Discrete Math - Pumping Lemma

Nonregular languages: How 0:04:56

Nonregular languages: How to use the Pumping Lemma

Pumping Lemma for 2:21:21

Pumping Lemma for Regular Languages TWENTY Examples and Proof Strategies!

Pumping Lemma (For 0:14:16

Pumping Lemma (For Regular Languages) | Example 1

Pumping Lemma (Regular) 0:11:59

Pumping Lemma (Regular) Example

[5b-1] Pumping Theorem 0:12:47

[5b-1] Pumping Theorem - partial examples (COMP2270 2017)

The unforgettable Pumping 0:17:49

The unforgettable Pumping Lemma! (Discrete Mathematics: Formal Languages and Automata)

[5b-2] Pumping Theorem 0:12:51

[5b-2] Pumping Theorem - using closure properties (COMP2270 2017)

Pumping Lemma for 0:11:48

Pumping Lemma for Regular Languages Example: 0ⁿ1ⁿ

[Mathematical Linguistics] Human 0:09:20

[Mathematical Linguistics] Human Language is NOT Regular

Regular Pumping Theorem 0:07:57

Regular Pumping Theorem

Pumping lemma and 0:22:01

Pumping lemma and exercises

Using the Pumping 0:20:38

Using the Pumping Lemma (Discrete Mathematics: Formal Languages and Automata)

Understanding the Pumping 0:10:06

Understanding the Pumping Lemma (Brief Intro to Formal Language Theory 20)

Pumping Lemma (For 0:08:06

Pumping Lemma (For Context Free Languages)

3. Regular Pumping 1:10:02

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

Pumping Lemma for 0:48:49

Pumping Lemma for Context-Free Languages: Four Examples

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

Chapter 16 - 0:13:14

Chapter 16 - Pumping Lemma Theorem for CFL

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

Best explanation I've seen so far!

ronborneo
Автор

You made an error around 4:00 when you made |vxy| = 4 > p, as p=3 in that case, so the pumping lemma cannot be correctly used.

EpicGifted
Автор

At 5:05 since vxy has length at most p it should be clear(considering length equal to p) that vxy can only cover 1 or 2 of the 3 numbers, pumping 1 or 2 of the 3 numbers will create inequality.

sdmartens
Автор

0:51 I think it should be clarified that for |vy| > 0 either v or y can be empty but not both. Other than that, solid explanation!

fardadhajirostami
Автор

Wonderful video! Just a small flaw: Until 8:08, I think you are missing two situations: v=0, y=0; and v=2, y=2. Since the length of vxy is smaller than p, it is also possible that vxy are all in 0 or all in 2. Have a nice day :P

johnerickson
Автор

Great video! I just want to ask for the logic behind using the pumping lemma. So in order to prove that a language is not context free I have to aim for a word that does not meet the requirements for all the possible choices I can make using the given things like the length of uxy etc.

yasenbonev