Question

Show that $\{a^i b^j c^k \mid i>j>k>0\}$ is not a context free language by using pumping lemma

score 1.8k · Answer 1 · 2026-03-25 01:18:29

1.8k

Views

Show that $\{a^i b^j c^k \mid i>j>k>0\}$ is not a context free language by using pumping lemma

Published on 25 Mar 2026 - 1:18

score 1.5k · Answer 2 · 2018-10-29 00:36:23

1.5k

Views

Use Pumping Lemma to show that $L_7$ is not context-free

Published on 29 Oct 2018 - 0:36

score 273 · Answer 3 · 2018-11-02 19:50:31

273

Views

Context free grammar with or conditionals

Published on 02 Nov 2018 - 19:50

score 261 · Answer 4 · 2018-11-07 04:38:15

261

Views

Ambiguous CFG to Unambiguous CFG Transformation

Published on 07 Nov 2018 - 4:38

score 178 · Answer 5 · 2026-03-25 01:14:10

178

Views

Pumping Lemma for CFL

Published on 25 Mar 2026 - 1:14

score 147 · Answer 6 · 2018-11-12 06:48:13

147

Views

$L_4 = \{x: \#_{1}(x) = 2 \cdot \#_{10}(x) \}$ Find CFG given hints

Published on 12 Nov 2018 - 6:48

score 40 · Answer 7 · 2026-03-22 13:45:05

40

Views

Context Free grammar to Chomsky Normal Form

Published on 22 Mar 2026 - 13:45

score 84 · Answer 8 · 2018-11-12 22:00:18

84

Views

Let $L_{n} = \{x \in \Sigma^* | x = ywz, w^R = w, |w| \geq n, |y| = |z| \}$ Generate a cfg of $L_n$

Published on 12 Nov 2018 - 22:00

score 1.1k · Answer 9 · 2018-11-18 23:25:41

1.1k

Views

Show that $L=\{a^nb^m : m \neq n\}$ is context free language using closure under union.

Published on 18 Nov 2018 - 23:25

score 133 · Answer 10 · 2018-11-19 18:06:59

133

Views

Show that the following language is context-free/not context free by expressing the language as the union of three other languages.

Published on 19 Nov 2018 - 18:06

score 490 · Answer 11 · 2026-03-25 01:18:24

490

Views

Searching for a proof for a variant of the pumping lemma for context free languages

Published on 25 Mar 2026 - 1:18

score 2.7k · Answer 12 · 2026-03-25 01:18:11

2.7k

Views

Proof verification of the language of all palindromes as being context-free

Published on 25 Mar 2026 - 1:18

score 216 · Answer 13 · 2018-12-06 01:01:07

216

Views

How would I go about proving that the language accepted by a regular expression is subset of the language accepted by a context free grammar?

Published on 06 Dec 2018 - 1:01

score 127 · Answer 14 · 2018-12-07 11:25:04

127

Views

On left recursive context-free grammars

Published on 07 Dec 2018 - 11:25

score 53 · Answer 15 · 2018-12-07 19:42:03

53

Views

Is $L = \{a^{i+j}b^{j+k}c^{i+k} | i,j,k > 0\}$ context free?

Published on 07 Dec 2018 - 19:42

List Question

Show that $\{a^i b^j c^k \mid i>j>k>0\}$ is not a context free language by using pumping lemma

Use Pumping Lemma to show that $L_7$ is not context-free

Context free grammar with or conditionals

Ambiguous CFG to Unambiguous CFG Transformation

Pumping Lemma for CFL

$L_4 = \{x: \#_{1}(x) = 2 \cdot \#_{10}(x) \}$ Find CFG given hints

Context Free grammar to Chomsky Normal Form

Let $L_{n} = \{x \in \Sigma^* | x = ywz, w^R = w, |w| \geq n, |y| = |z| \}$ Generate a cfg of $L_n$

Show that $L=\{a^nb^m : m \neq n\}$ is context free language using closure under union.

Show that the following language is context-free/not context free by expressing the language as the union of three other languages.

Searching for a proof for a variant of the pumping lemma for context free languages

Proof verification of the language of all palindromes as being context-free

How would I go about proving that the language accepted by a regular expression is subset of the language accepted by a context free grammar?

On left recursive context-free grammars

Is $L = \{a^{i+j}b^{j+k}c^{i+k} | i,j,k > 0\}$ context free?

Trending Questions

Popular # Hahtags

Popular Questions