Question

Pumping lemma L={$a^i$ $b^j$, / 0<j<i<infinity}?

score 83 · Answer 1 · 2026-04-15 02:56:23

83

Views

Pumping lemma L={$a^i$ $b^j$, / 0<j<i<infinity}?

Published on 15 Apr 2026 - 2:56

score 476 · Answer 2 · 2026-04-13 02:24:49

476

Views

Prove that the language L is not a regular language, using pumping lemma

Published on 13 Apr 2026 - 2:24

score 63 · Answer 3 · 2026-04-10 17:08:51

63

Views

Proving a Context Free Language

Published on 10 Apr 2026 - 17:08

score 972 · Answer 4 · 2026-04-14 11:10:44

972

Views

Is this enough to prove that the language L is not context-free? (Pumping lemma for CFL's)

Published on 14 Apr 2026 - 11:10

score 128 · Answer 5 · 2026-04-14 12:20:08

128

Views

(Pumping Lemma for Regular Languages) Is this proof that L is not regular?

Published on 14 Apr 2026 - 12:20

score 170 · Answer 6 · 2026-04-13 16:10:00

170

Views

L = { u#w | u != w} context-free

Published on 13 Apr 2026 - 16:10

score 73 · Answer 7 · 2026-04-13 11:54:33

73

Views

Proving language is not context free using pumping lemma

Published on 13 Apr 2026 - 11:54

score 38 · Answer 8 · 2026-04-16 10:55:20

38

Views

Prove that $L=\left\{ab^{k_1}ab^{k_2}...ab^{k_n}c^m|\forall i:k_i>0\text{ and } m>n>0\right\}$ is not regular using Pumping Lemma

Published on 16 Apr 2026 - 10:55

score 2.6k · Answer 9 · 2026-04-14 14:42:38

2.6k

Views

Using pumping lemma to prove that $L:=\{a^{k^3} \mid k\geq 0\}$ is not regular

Published on 14 Apr 2026 - 14:42

score 92 · Answer 10 · 2026-04-15 09:35:38

92

Views

$L = \{ 0^p | \, p \,\text{ is prime} \}$ is not regular

Published on 15 Apr 2026 - 9:35

score 169 · Answer 11 · 2026-04-13 02:31:12

169

Views

Proving with the pumping lemma that the following language is not regular

Published on 13 Apr 2026 - 2:31

score 1.9k · Answer 12 · 2026-04-14 11:00:15

1.9k

Views

Using Pumping Lemma prove that the language $L = \{a^ib^j \mid i,j \in N \}$ is Not Regular.

Published on 14 Apr 2026 - 11:00

score 42 · Answer 13 · 2026-04-13 23:50:23

42

Views

Showing language is irregular with pumping lemma

Published on 13 Apr 2026 - 23:50

score 2.5k · Answer 14 · 2026-04-16 16:12:10

2.5k

Views

disprove $L = \{ a^nb^n\mid n \geq 0 \}$ is not a context-free using Pumping Lemma for Context-Free Languages

Published on 16 Apr 2026 - 16:12

score 120 · Answer 15 · 2026-03-25 03:03:13

120

Views

The correctness of a statement related to the Pumping Lemma and regular language

Published on 25 Mar 2026 - 3:03

List Question

Pumping lemma L={$a^i$ $b^j$, / 0<j<i<infinity}?

Prove that the language L is not a regular language, using pumping lemma

Proving a Context Free Language

Is this enough to prove that the language L is not context-free? (Pumping lemma for CFL's)

(Pumping Lemma for Regular Languages) Is this proof that L is not regular?

L = { u#w | u != w} context-free

Proving language is not context free using pumping lemma

Prove that $L=\left\{ab^{k_1}ab^{k_2}...ab^{k_n}c^m|\forall i:k_i>0\text{ and } m>n>0\right\}$ is not regular using Pumping Lemma

Using pumping lemma to prove that $L:=\{a^{k^3} \mid k\geq 0\}$ is not regular

$L = \{ 0^p | \, p \,\text{ is prime} \}$ is not regular

Proving with the pumping lemma that the following language is not regular

Using Pumping Lemma prove that the language $L = \{a^ib^j \mid i,j \in N \}$ is Not Regular.

Showing language is irregular with pumping lemma

disprove $L = \{ a^nb^n\mid n \geq 0 \}$ is not a context-free using Pumping Lemma for Context-Free Languages

The correctness of a statement related to the Pumping Lemma and regular language

Trending Questions

Popular # Hahtags

Popular Questions