List questions from context-free-grammar

Published on 08 Dec 2017 - 16:45

369

Views

How to prove this language is not context free?

Published on 25 Mar 2026 - 17:19

37

Views

define a type $0$ grammar to accept the language

Published on 19 Dec 2017 - 17:16

348

Views

CFG for $L = \{{ ABC \ | \ A, B, C \in \{{0,1\}}^∗ \ ,\ |A| = |B| = |C| \ \ and \ \ A\neq C\}}$

Published on 21 Dec 2017 - 14:29

31

Views

Minimized single-string grammar size approximation.

Published on 25 Mar 2026 - 20:39

144

Views

construct a linear pushdown automata

Published on 22 Mar 2026 - 14:22

229

Views

Is the set {p | Lp is context free} decidable, semidecidable, or not semidecidable?

Published on 23 Feb 2026 - 19:17

1k

Views

Is $0^m1^n$ a regular language?

Published on 25 Mar 2026 - 17:23

3.3k

Views

Is the language $L = \{0^m1^n: m \neq n - 1 \}$ context free?

Published on 11 Aug 2011 - 3:08

5.9k

Views

Is the language $L = \{a^ib^jc^kd^l : i,j,k,l \geq 0 \text{ and } i + k = j + l\}$ context free language?

Published on 15 Aug 2011 - 16:48

22.3k

Views

Question regarding Context Free Grammar exercises

Published on 21 Aug 2011 - 7:46

9k

Views

What is the CFG of the language that generates all strings over alphabet $\{a, b, c\}$?

Published on 21 Aug 2011 - 21:25

2.4k

Views

Chomsky Normal Form Questions

Published on 29 Sep 2011 - 23:11

692

Views

Is $L=\{a^{i}b^{j}c^{k}\mid i\geq j\geq k\} $ a context-free language

Published on 30 Oct 2011 - 20:32

257

Views

CFG pumping lemma

Published on 01 Nov 2011 - 5:19

List Question

Eliminating Epsilon Productions from CFG

How to prove this language is not context free?

define a type $0$ grammar to accept the language

CFG for $L = \{{ ABC \ | \ A, B, C \in \{{0,1\}}^∗ \ ,\ |A| = |B| = |C| \ \ and \ \ A\neq C\}}$

Minimized single-string grammar size approximation.

construct a linear pushdown automata

Is the set {p | Lp is context free} decidable, semidecidable, or not semidecidable?

Is $0^m1^n$ a regular language?

Is the language $L = \{0^m1^n: m \neq n - 1 \}$ context free?

Is the language $L = \{a^ib^jc^kd^l : i,j,k,l \geq 0 \text{ and } i + k = j + l\}$ context free language?

Question regarding Context Free Grammar exercises

What is the CFG of the language that generates all strings over alphabet $\{a, b, c\}$?

Chomsky Normal Form Questions

Is $L=\{a^{i}b^{j}c^{k}\mid i\geq j\geq k\} $ a context-free language

CFG pumping lemma

Trending Questions

Popular # Hahtags

Popular Questions