Question

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

score 281 · Answer 1 · 2019-10-15 01:11:49

281

Views

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

Published on 15 Oct 2019 - 1:11

score 82 · Answer 2 · 2019-11-04 16:36:51

82

Views

Pumping Lemma - Grammar - Regular language

Published on 04 Nov 2019 - 16:36

score 28 · Answer 3 · 2019-11-05 00:19:33

28

Views

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

Published on 05 Nov 2019 - 0:19

score 238 · Answer 4 · 2019-11-18 20:46:07

238

Views

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

Published on 18 Nov 2019 - 20:46

score 69 · Answer 5 · 2019-11-21 20:50:17

69

Views

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

Published on 21 Nov 2019 - 20:50

score 89 · Answer 6 · 2019-12-10 23:11:45

89

Views

Using Pumping Lemma for Context Free Languages

Published on 10 Dec 2019 - 23:11

score 2.3k · Answer 7 · 2020-01-13 03:45:37

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 13 Jan 2020 - 3:45

score 55 · Answer 8 · 2020-01-14 16:17:17

55

Views

Show that the language $L$ is not regular

Published on 14 Jan 2020 - 16:17

score 41 · Answer 9 · 2020-02-27 04:49:29

41

Views

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

Published on 27 Feb 2020 - 4:49

score 1.6k · Answer 10 · 2020-03-10 21:15:58

1.6k

Views

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

Published on 10 Mar 2020 - 21:15

score 376 · Answer 11 · 2020-03-24 17:59:52

376

Views

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

Published on 24 Mar 2020 - 17:59

score 212 · Answer 12 · 2020-03-27 08:56:17

212

Views

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

Published on 27 Mar 2020 - 8:56

score 684 · Answer 13 · 2020-04-04 06:24:33

684

Views

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

Published on 04 Apr 2020 - 6:24

score 50 · Answer 14 · 2020-04-07 11:29:15

50

Views

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

Published on 07 Apr 2020 - 11:29

score 824 · Answer 15 · 2020-04-25 19:03:49

824

Views

pumping lemma - union of regular languages

Published on 25 Apr 2020 - 19:03

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