Question

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

score 80 · Answer 1 · 2019-03-10 06:12:01

80

Views

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

Published on 10 Mar 2019 - 6:12

score 473 · Answer 2 · 2019-04-29 14:55:29

473

Views

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

Published on 29 Apr 2019 - 14:55

score 58 · Answer 3 · 2019-05-02 06:29:14

58

Views

Proving a Context Free Language

Published on 02 May 2019 - 6:29

score 969 · Answer 4 · 2019-05-02 23:47:30

969

Views

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

Published on 02 May 2019 - 23:47

score 125 · Answer 5 · 2019-05-03 00:59:26

125

Views

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

Published on 03 May 2019 - 0:59

score 165 · Answer 6 · 2019-05-13 19:03:11

165

Views

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

Published on 13 May 2019 - 19:03

score 70 · Answer 7 · 2019-05-18 20:42:49

70

Views

Proving language is not context free using pumping lemma

Published on 18 May 2019 - 20:42

score 35 · Answer 8 · 2019-06-16 16:29:51

35

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 Jun 2019 - 16:29

score 2.6k · Answer 9 · 2019-07-16 20:37:17

2.6k

Views

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

Published on 16 Jul 2019 - 20:37

score 90 · Answer 10 · 2019-09-07 14:23:47

90

Views

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

Published on 07 Sep 2019 - 14:23

score 166 · Answer 11 · 2019-09-08 14:32:52

166

Views

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

Published on 08 Sep 2019 - 14:32

score 1.9k · Answer 12 · 2019-09-24 15:26:44

1.9k

Views

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

Published on 24 Sep 2019 - 15:26

score 39 · Answer 13 · 2019-10-01 19:38:28

39

Views

Showing language is irregular with pumping lemma

Published on 01 Oct 2019 - 19:38

score 2.5k · Answer 14 · 2014-10-03 14:37:46

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 03 Oct 2014 - 14:37

score 119 · Answer 15 · 2019-10-02 08:38:41

119

Views

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

Published on 02 Oct 2019 - 8:38

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