Question

What are the gists of CNF and GNF of CFG's?

score 351 · Answer 1 · 2020-07-01 14:46:27

351

Views

What are the gists of CNF and GNF of CFG's?

Published on 01 Jul 2020 - 14:46

score 93 · Answer 2 · 2020-07-01 14:58:57

93

Views

Is every production in a CFG an $A$-production?

Published on 01 Jul 2020 - 14:58

score 344 · Answer 3 · 2020-07-03 06:34:17

344

Views

What is the minimum and maximum number of productions in Chomsky and Greibach Normal forms?

Published on 03 Jul 2020 - 6:34

score 400 · Answer 4 · 2026-02-23 08:34:16

400

Views

Prove that $L=\big\{\langle G\rangle \mid G\text{ is a CFG over }\Sigma=\{0,1\}\text{ and }1^* \cap L(G)\ne\varnothing\big\}$ is decidable.

Published on 23 Feb 2026 - 8:34

score 1.1k · Answer 5 · 2026-03-25 06:06:19

1.1k

Views

Formally proving that $\{ L = { {a^i}{b^j}{c^k}, j = \min(i,k), i, k > 0\} } $ is context-free

Published on 25 Mar 2026 - 6:06

score 86 · Answer 6 · 2026-03-25 09:43:09

86

Views

Context free grammar for language $\{ \{a,b\}^*$: where the number of $a$'s is unequal to the number of $b$'s$\}$

Published on 25 Mar 2026 - 9:43

score 110 · Answer 7 · 2026-03-25 07:02:13

110

Views

Is every sentential form also a right-sentential form?

Published on 25 Mar 2026 - 7:02

score 242 · Answer 8 · 2026-03-25 05:58:56

242

Views

Pumping Lemma for CF language exercise

Published on 25 Mar 2026 - 5:58

score 977 · Answer 9 · 2020-07-18 17:41:36

977

Views

If L* is context-free, is L context-free as well?

Published on 18 Jul 2020 - 17:41

score 1.8k · Answer 10 · 2020-07-19 17:20:15

1.8k

Views

Is there a context free grammar that is both in Chomsky Normal Form and ambiguous?

Published on 19 Jul 2020 - 17:20

score 163 · Answer 11 · 2020-07-20 08:01:32

163

Views

Determine if complement of non-regular language is context-free

Published on 20 Jul 2020 - 8:01

score 153 · Answer 12 · 2020-07-21 04:12:08

153

Views

Is this language $L$ context free?

Published on 21 Jul 2020 - 4:12

score 153 · Answer 13 · 2020-07-21 14:52:53

153

Views

CFL grammer questions

Published on 21 Jul 2020 - 14:52

score 61 · Answer 14 · 2016-07-30 01:38:06

61

Views

Construct a grammar for $L=\{a^k b^l \ldots a^k b^l : k\geq 2 , l\geq 1\text{ and }a^k b^l \text{ is repeated at least once}\}$

Published on 30 Jul 2016 - 1:38

score 456 · Answer 15 · 2016-08-02 19:41:11

456

Views

Constructing a specific context free grammar

Published on 02 Aug 2016 - 19:41

List Question

What are the gists of CNF and GNF of CFG's?

Is every production in a CFG an $A$-production?

What is the minimum and maximum number of productions in Chomsky and Greibach Normal forms?

Prove that $L=\big\{\langle G\rangle \mid G\text{ is a CFG over }\Sigma=\{0,1\}\text{ and }1^* \cap L(G)\ne\varnothing\big\}$ is decidable.

Formally proving that $\{ L = { {a^i}{b^j}{c^k}, j = \min(i,k), i, k > 0\} } $ is context-free

Context free grammar for language $\{ \{a,b\}^*$: where the number of $a$'s is unequal to the number of $b$'s$\}$

Is every sentential form also a right-sentential form?

Pumping Lemma for CF language exercise

If L* is context-free, is L context-free as well?

Is there a context free grammar that is both in Chomsky Normal Form and ambiguous?

Determine if complement of non-regular language is context-free

Is this language $L$ context free?

CFL grammer questions

Construct a grammar for $L=\{a^k b^l \ldots a^k b^l : k\geq 2 , l\geq 1\text{ and }a^k b^l \text{ is repeated at least once}\}$

Constructing a specific context free grammar

Trending Questions

Popular # Hahtags

Popular Questions