List questions from context-free-grammar

Published on 06 May 2020 - 18:50

73

Views

CF grammar for a Language.

Published on 09 May 2020 - 17:06

70

Views

Finding Context free grammar from a language

Published on 11 May 2020 - 17:10

362

Views

Constructing CFG for even length words with maximum of two 0's

Published on 14 May 2020 - 14:09

28

Views

$\mathcal{G} = \{ v_2 v_4 \ldots v_{k} ~:~ v_1 v_2 v_3 v_4 \ldots v_{k-1} v_{k} \in \mathcal{L}, ~ \text{k even} \} $ is context free language

Published on 22 May 2020 - 6:59

427

Views

Convert grammar into Chomsky Normal Form

Published on 02 Jun 2020 - 23:08

69

Views

Proof for pumping lemma for new kind of CFL

Published on 25 Mar 2026 - 6:03

44

Views

Converting linear grammar to normal form

Published on 25 Mar 2026 - 9:33

193

Views

Intersection and union between two context-free languages

Published on 05 Jun 2020 - 18:25

173

Views

for language L={a^n b^m c^l d^k | n==l,m==k} is correct or not?

Published on 06 Jun 2020 - 7:02

306

Views

What are the relations between pushdown automata and parsers?

Published on 22 Mar 2026 - 16:00

59

Views

Is A -> BB valid under Chomsky's normal form?

Published on 14 Jun 2020 - 21:31

1.2k

Views

How to prove that the language L={w1#w2#. . .#wk: k ≥ 2, each wi ∈ {0,1}^* , and wi = wj for some i !=j} is not context free using the pumping lemma?

Published on 25 Mar 2026 - 7:45

42

Views

How to transform a regular expression into a context free grammar with 2 variables?

Published on 27 Jun 2020 - 18:11

161

Views

How to use the pumping lemma to prove that $a^{m}b^{n}a^{m}c^n$ is not context free?

Published on 25 Mar 2026 - 6:07

List Question

Finding the context free language

CF grammar for a Language.

Finding Context free grammar from a language

Constructing CFG for even length words with maximum of two 0's

$\mathcal{G} = \{ v_2 v_4 \ldots v_{k} ~:~ v_1 v_2 v_3 v_4 \ldots v_{k-1} v_{k} \in \mathcal{L}, ~ \text{k even} \} $ is context free language

Convert grammar into Chomsky Normal Form

Proof for pumping lemma for new kind of CFL

Converting linear grammar to normal form

Intersection and union between two context-free languages

for language L={a^n b^m c^l d^k | n==l,m==k} is correct or not?

What are the relations between pushdown automata and parsers?

Is A -> BB valid under Chomsky's normal form?

How to prove that the language L={w1#w2#. . .#wk: k ≥ 2, each wi ∈ {0,1}^* , and wi = wj for some i !=j} is not context free using the pumping lemma?

How to transform a regular expression into a context free grammar with 2 variables?

How to use the pumping lemma to prove that $a^{m}b^{n}a^{m}c^n$ is not context free?

Trending Questions

Popular # Hahtags

Popular Questions