Question

pumping lemma - choice of partition

score 654 · Answer 1 · 2016-06-26 13:28:07

654

Views

pumping lemma - choice of partition

Published on 26 Jun 2016 - 13:28

score 1.2k · Answer 2 · 2014-02-19 15:44:23

1.2k

Views

Pumping Lemma for regular languages proof template

Published on 19 Feb 2014 - 15:44

score 5.6k · Answer 3 · 2017-04-10 18:55:30

5.6k

Views

The language L = { $a^nb^mc^n$ | $m \ge n$ } is not context-free. Pumping Lemma through 6 cases.

Published on 10 Apr 2017 - 18:55

score 1k · Answer 4 · 2017-04-14 20:50:10

1k

Views

The language L = { $a^n $ such that $n = b^2$ for some integer b } is not regular. Prove it using Pumping Lemma for Regular Languages.

Published on 14 Apr 2017 - 20:50

score 61 · Answer 5 · 2017-04-15 14:11:18

61

Views

How to show that the language containing the words which number of $b$ divides the number of $a$ isn't regular using pumping lemma?

Published on 15 Apr 2017 - 14:11

score 506 · Answer 6 · 2017-04-15 19:04:26

506

Views

How to show that the language containing words which length are prime numbers isn't regular using pumping lemma?

Published on 15 Apr 2017 - 19:04

score 278 · Answer 7 · 2017-04-16 17:34:14

278

Views

How to show that the language containing the words which length are of power of $2$ isn't regular using pumping lemma?

Published on 16 Apr 2017 - 17:34

score 1.8k · Answer 8 · 2017-05-18 16:36:09

1.8k

Views

Pumping Lemma for Regular Languages confusion: do I need to prove the case for a single $y^i$, or a set of them?

Published on 18 May 2017 - 16:36

score 67 · Answer 9 · 2017-05-31 17:37:31

67

Views

Does$\{w\in\Sigma^=\{a,b\}^: \nexists u\in \Sigma^*, w=uu\}$ uphold the pumping lemma

Published on 31 May 2017 - 17:37

score 716 · Answer 10 · 2017-06-03 00:47:30

716

Views

Show that the language $\{w \in \{a,b\}^* : \#w_b = \#w_a + 2 \}$ is not regular using the Pumping Lemma

Published on 03 Jun 2017 - 0:47

score 777 · Answer 11 · 2017-06-14 21:18:59

777

Views

Need some explanation of Pumping lemma for CFL

Published on 14 Jun 2017 - 21:18

score 470 · Answer 12 · 2017-07-12 17:07:29

470

Views

Trouble with Pumping Lemma

Published on 12 Jul 2017 - 17:07

score 382 · Answer 13 · 2017-07-15 12:29:14

382

Views

Pumping Lemma does not hold for the regular expression $101$, or similar?

Published on 15 Jul 2017 - 12:29

score 1.5k · Answer 14 · 2017-09-18 17:15:37

1.5k

Views

prove that l={w ∈ {0, 1}*: n0(w) ≠ n1(w)} is a non regular language?

Published on 18 Sep 2017 - 17:15

score 1.6k · Answer 15 · 2017-10-09 09:11:08

1.6k

Views

Prove that $L = \{ a^nb^m : m = n^3 \}$ is not Context Free using Pumping Lemma

Published on 09 Oct 2017 - 9:11

List Question

pumping lemma - choice of partition

Pumping Lemma for regular languages proof template

The language L = { $a^nb^mc^n$ | $m \ge n$ } is not context-free. Pumping Lemma through 6 cases.

The language L = { $a^n $ such that $n = b^2$ for some integer b } is not regular. Prove it using Pumping Lemma for Regular Languages.

How to show that the language containing the words which number of $b$ divides the number of $a$ isn't regular using pumping lemma?

How to show that the language containing words which length are prime numbers isn't regular using pumping lemma?

How to show that the language containing the words which length are of power of $2$ isn't regular using pumping lemma?

Pumping Lemma for Regular Languages confusion: do I need to prove the case for a single $y^i$, or a set of them?

Does$\{w\in\Sigma^=\{a,b\}^: \nexists u\in \Sigma^*, w=uu\}$ uphold the pumping lemma

Show that the language $\{w \in \{a,b\}^* : \#w_b = \#w_a + 2 \}$ is not regular using the Pumping Lemma

Need some explanation of Pumping lemma for CFL

Trouble with Pumping Lemma

Pumping Lemma does not hold for the regular expression $101$, or similar?

prove that l={w ∈ {0, 1}*: n0(w) ≠ n1(w)} is a non regular language?

Prove that $L = \{ a^nb^m : m = n^3 \}$ is not Context Free using Pumping Lemma

Trending Questions

Popular # Hahtags

Popular Questions