Question

Union of two non-regular languages.

score 13.1k · Answer 1 · 2026-04-11 01:49:12

13.1k

Views

Union of two non-regular languages.

Published on 11 Apr 2026 - 1:49

score 1.5k · Answer 2 · 2026-04-15 20:18:05

1.5k

Views

The Language {xx}, of any string followed by another copy of the same string, is not Context Free. Using Pumping Lemma, through 13 cases.

Published on 15 Apr 2026 - 20:18

score 67 · Answer 3 · 2026-04-16 20:48:07

67

Views

Determining whether a given language is regular

Published on 16 Apr 2026 - 20:48

score 106 · Answer 4 · 2026-04-15 00:08:14

106

Views

Use the pumping lemma to show that following language is not context-free

Published on 15 Apr 2026 - 0:08

score 2.4k · Answer 5 · 2026-04-13 20:11:01

2.4k

Views

Using pumping lemma show that language $L = \{a^{n^2} | n≥ 0\}$ is not regular.

Published on 13 Apr 2026 - 20:11

score 40 · Answer 6 · 2026-04-13 22:26:51

40

Views

Using CFL pumping lemma to show that a language is not context free

Published on 13 Apr 2026 - 22:26

score 77 · Answer 7 · 2026-04-15 03:12:07

77

Views

Proof that $L =$ {$a^p : \text{p is prime} $} is not regular

Published on 15 Apr 2026 - 3:12

score 50 · Answer 8 · 2026-04-12 09:08:54

50

Views

Find the mistakes(pumping lemma proof). Can you help me?

Published on 12 Apr 2026 - 9:08

score 31 · Answer 9 · 2026-04-11 12:38:29

31

Views

I want to prove the pumping lemma for context-free languages but instead of using Chomsky's form using a new form.

Published on 11 Apr 2026 - 12:38

score 35 · Answer 10 · 2026-04-12 10:32:59

35

Views

Prove a class of regular languages is not closed under a weird concatenation operation

Published on 12 Apr 2026 - 10:32

score 59 · Answer 11 · 2026-04-16 17:57:47

59

Views

$L=\{0^m1^n \mid3m\leq 2n\}$ via pumping lemma

Published on 16 Apr 2026 - 17:57

score 282 · Answer 12 · 2026-04-12 17:53:59

282

Views

Proving that a language whose strings have prime length is not context-free

Published on 12 Apr 2026 - 17:53

score 61 · Answer 13 · 2026-04-15 08:37:40

61

Views

Is the Language $L=\{(ab)^{3n}\:|\:n\in\mathbb N\}$ regular?

Published on 15 Apr 2026 - 8:37

score 86 · Answer 14 · 2026-04-11 18:48:42

86

Views

Does pumping lemma ever fail?

Published on 11 Apr 2026 - 18:48

score 635 · Answer 15 · 2026-04-29 19:59:27

635

Views

Understanding the proof that uses Pumping Lemma that the language $C =\{w \mid w$ has an equal number of $0$'s and $1$'s$\}$ is not regular

Published on 29 Apr 2026 - 19:59

List Question

Union of two non-regular languages.

The Language {xx}, of any string followed by another copy of the same string, is not Context Free. Using Pumping Lemma, through 13 cases.

Determining whether a given language is regular

Use the pumping lemma to show that following language is not context-free

Using pumping lemma show that language $L = \{a^{n^2} | n≥ 0\}$ is not regular.

Using CFL pumping lemma to show that a language is not context free

Proof that $L =$ {$a^p : \text{p is prime} $} is not regular

Find the mistakes(pumping lemma proof). Can you help me?

I want to prove the pumping lemma for context-free languages but instead of using Chomsky's form using a new form.

Prove a class of regular languages is not closed under a weird concatenation operation

$L=\{0^m1^n \mid3m\leq 2n\}$ via pumping lemma

Proving that a language whose strings have prime length is not context-free

Is the Language $L=\{(ab)^{3n}\:|\:n\in\mathbb N\}$ regular?

Does pumping lemma ever fail?

Understanding the proof that uses Pumping Lemma that the language $C =\{w \mid w$ has an equal number of $0$'s and $1$'s$\}$ is not regular

Trending Questions

Popular # Hahtags

Popular Questions