Question

Is $\{a^nb^mc^{n+m} \mid n, m \geqslant 0\}$ a context-free language (CFL)??

score 764 · Answer 1 · 2026-03-25 20:13:52

764

Views

Is $\{a^nb^mc^{n+m} \mid n, m \geqslant 0\}$ a context-free language (CFL)??

Published on 25 Mar 2026 - 20:13

score 38 · Answer 2 · 2021-06-12 09:48:34

38

Views

Find a CFG for $(0 \cup10)^*(1+\epsilon)$

Published on 12 Jun 2021 - 9:48

score 2.8k · Answer 3 · 2021-06-13 18:21:19

2.8k

Views

Show that $L=\{a^i b^j c^k\,:\, i < j < k\}$ is not context free

Published on 13 Jun 2021 - 18:21

score 308 · Answer 4 · 2026-02-23 08:28:29

308

Views

Prove\Disprove: If $L_1$ is not a CFL, and $L_2$ is finite, then $L_1 \cup L_2$ is not a CFL.

Published on 23 Feb 2026 - 8:28

score 22 · Answer 5 · 2021-06-16 07:27:18

22

Views

How to define the language generated by context-free grammar?

Published on 16 Jun 2021 - 7:27

score 144 · Answer 6 · 2021-06-22 12:15:43

144

Views

Is this language context-free?$ (a^i b^j c^k | i=k-j, i>0, k>0, j>0)$

Published on 22 Jun 2021 - 12:15

score 155 · Answer 7 · 2026-03-25 20:15:20

155

Views

Use pumping-lemma to prove that L is not a context-free language

Published on 25 Mar 2026 - 20:15

score 83 · Answer 8 · 2021-07-06 22:53:06

83

Views

Give a context-free grammar

Published on 06 Jul 2021 - 22:53

score 470 · Answer 9 · 2021-07-13 16:10:15

470

Views

Do we always need to add a new start symbol when converting to Chomsky Normal Form?

Published on 13 Jul 2021 - 16:10

score 1k · Answer 10 · 2021-07-13 19:24:14

1k

Views

How would you define "twice as many" when 0 is concerned?

Published on 13 Jul 2021 - 19:24

score 323 · Answer 11 · 2026-02-23 02:46:58

323

Views

Is there really a proof that all context-free grammars can be parsed using a LL(1) grammar without backtracking?

Published on 23 Feb 2026 - 2:46

score 119 · Answer 12 · 2021-08-28 17:16:12

119

Views

CFG: Translate English sentence to math basic logic

Published on 28 Aug 2021 - 17:16

score 142 · Answer 13 · 2021-09-03 10:56:40

142

Views

proof / disproof of context-free language

Published on 03 Sep 2021 - 10:56

score 2.2k · Answer 14 · 2021-09-07 16:32:16

2.2k

Views

How to design a regular language that accept all binary string except for string that contains one specific occurrences?

Published on 07 Sep 2021 - 16:32

score 115 · Answer 15 · 2026-03-26 03:11:14

115

Views

Is $a^n b^n$ context free even if we take strings instead of characters?

Published on 26 Mar 2026 - 3:11

List Question

Is $\{a^nb^mc^{n+m} \mid n, m \geqslant 0\}$ a context-free language (CFL)??

Find a CFG for $(0 \cup10)^*(1+\epsilon)$

Show that $L=\{a^i b^j c^k\,:\, i < j < k\}$ is not context free

Prove\Disprove: If $L_1$ is not a CFL, and $L_2$ is finite, then $L_1 \cup L_2$ is not a CFL.

How to define the language generated by context-free grammar?

Is this language context-free?$ (a^i b^j c^k | i=k-j, i>0, k>0, j>0)$

Use pumping-lemma to prove that L is not a context-free language

Give a context-free grammar

Do we always need to add a new start symbol when converting to Chomsky Normal Form?

How would you define "twice as many" when 0 is concerned?

Is there really a proof that all context-free grammars can be parsed using a LL(1) grammar without backtracking?

CFG: Translate English sentence to math basic logic

proof / disproof of context-free language

How to design a regular language that accept all binary string except for string that contains one specific occurrences?

Is $a^n b^n$ context free even if we take strings instead of characters?

Trending Questions

Popular # Hahtags

Popular Questions