Question

How can I prove that this language is not context free?

score 282 · Answer 1 · 2026-03-25 04:39:43

282

Views

How can I prove that this language is not context free?

Published on 25 Mar 2026 - 4:39

score 83 · Answer 2 · 2026-03-25 04:35:46

83

Views

Pumping Lemma - Grammar - Regular language

Published on 25 Mar 2026 - 4:35

score 29 · Answer 3 · 2026-03-25 04:41:20

29

Views

Prove, that $L:=\{w\cdot d\cdot \overleftarrow{w}\mid w\in \{a,b\}^+\}$ is not regular using the pumping-lemma

Published on 25 Mar 2026 - 4:41

score 239 · Answer 4 · 2026-03-25 04:43:50

239

Views

Context-free languages are not closed under SWAP$(L) = \{ yxz \mid x, y, z \in \Sigma^{*} $ and $ xyz \in L \}$

Published on 25 Mar 2026 - 4:43

score 70 · Answer 5 · 2026-03-25 04:40:18

70

Views

Show, that $L$ is not regular but satisfies the pumping-property.

Published on 25 Mar 2026 - 4:40

score 92 · Answer 6 · 2026-04-10 10:03:13

92

Views

Using Pumping Lemma for Context Free Languages

Published on 10 Apr 2026 - 10:03

score 2.3k · Answer 7 · 2026-03-25 04:41:41

2.3k

Views

Proving that $L = \left\{a^{n^2} | n \ge 0\right\}$ is not context free with Pumping Lemma for CFG?

Published on 25 Mar 2026 - 4:41

score 58 · Answer 8 · 2026-04-12 11:08:46

58

Views

Show that the language $L$ is not regular

Published on 12 Apr 2026 - 11:08

score 44 · Answer 9 · 2026-04-16 12:27:12

44

Views

pumping lemma $a^{n} (b a^{n-1})n$ times where $n$ decrements each time

Published on 16 Apr 2026 - 12:27

score 1.6k · Answer 10 · 2026-04-09 22:57:30

1.6k

Views

How to prove that an even palindrome is not regular using pumping lemma?

Published on 09 Apr 2026 - 22:57

score 377 · Answer 11 · 2026-03-25 04:40:41

377

Views

What is the difference between pumping Lemma for regualar languages and pumping lemma for context free languages?

Published on 25 Mar 2026 - 4:40

score 215 · Answer 12 · 2026-04-11 14:24:22

215

Views

How to prove that a language is not regular without the use of the Pumping Lemma?

Published on 11 Apr 2026 - 14:24

score 686 · Answer 13 · 2026-04-13 08:39:41

686

Views

Why is the minimal pumping length for $(01)^*$ equal to 1?

Published on 13 Apr 2026 - 8:39

score 51 · Answer 14 · 2026-03-25 16:02:20

51

Views

Which part of the string $00011112222$ can be pumped?

Published on 25 Mar 2026 - 16:02

score 829 · Answer 15 · 2026-04-17 08:10:24

829

Views

pumping lemma - union of regular languages

Published on 17 Apr 2026 - 8:10

List Question

How can I prove that this language is not context free?

Pumping Lemma - Grammar - Regular language

Prove, that $L:=\{w\cdot d\cdot \overleftarrow{w}\mid w\in \{a,b\}^+\}$ is not regular using the pumping-lemma

Context-free languages are not closed under SWAP$(L) = \{ yxz \mid x, y, z \in \Sigma^{*} $ and $ xyz \in L \}$

Show, that $L$ is not regular but satisfies the pumping-property.

Using Pumping Lemma for Context Free Languages

Proving that $L = \left\{a^{n^2} | n \ge 0\right\}$ is not context free with Pumping Lemma for CFG?

Show that the language $L$ is not regular

pumping lemma $a^{n} (b a^{n-1})n$ times where $n$ decrements each time

How to prove that an even palindrome is not regular using pumping lemma?

What is the difference between pumping Lemma for regualar languages and pumping lemma for context free languages?

How to prove that a language is not regular without the use of the Pumping Lemma?

Why is the minimal pumping length for $(01)^*$ equal to 1?

Which part of the string $00011112222$ can be pumped?

pumping lemma - union of regular languages

Trending Questions

Popular # Hahtags

Popular Questions