Question

Confusion related to the union of two type 3 grammar

score 205 · Answer 1 · 2012-09-20 01:41:50

205

Views

Confusion related to the union of two type 3 grammar

Published on 20 Sep 2012 - 1:41

score 69 · Answer 2 · 2012-09-21 03:15:06

69

Views

Confusion related to context free grammar

Published on 21 Sep 2012 - 3:15

score 1k · Answer 3 · 2026-03-25 22:09:15

1k

Views

Prove that L(G1) is a regular language

Published on 25 Mar 2026 - 22:09

score 410 · Answer 4 · 2012-09-27 23:32:23

410

Views

Confirm that this language is context free?

Published on 27 Sep 2012 - 23:32

score 5.1k · Answer 5 · 2012-09-28 01:31:50

5.1k

Views

Write a Context Free Grammar for L = {x#y | x =/= reverse of y}

Published on 28 Sep 2012 - 1:31

score 2k · Answer 6 · 2012-09-29 21:15:38

2k

Views

Context free languages closure property $\{a^n b^n : n\geq 0\} \cup \{a^n b^{2n}: n\geq 0\}$

Published on 29 Sep 2012 - 21:15

score 4.9k · Answer 7 · 2012-10-03 18:07:51

4.9k

Views

Pushdown automata for the language $\{ w001w^\text{R} : w = \{0,1\}^* \}$

Published on 03 Oct 2012 - 18:07

score 119 · Answer 8 · 2012-10-03 20:23:43

119

Views

Prove $\{0,1\}^* -\{0^i 1^i\mid i \ge 0\}$ is context free?

Published on 03 Oct 2012 - 20:23

score 737 · Answer 9 · 2012-10-06 21:31:24

737

Views

Proving that for every context-free language there exist a pushdown automata $M$ s.t. $L=L_{e}(M)$

Published on 06 Oct 2012 - 21:31

score 3.6k · Answer 10 · 2012-10-07 11:19:59

3.6k

Views

Proving the context-free languages are closed under reverse

Published on 07 Oct 2012 - 11:19

score 2k · Answer 11 · 2012-10-07 18:19:15

2k

Views

Why is $T \Rightarrow aba$ false, but $T \stackrel{*}{\Rightarrow}$ true?

Published on 07 Oct 2012 - 18:19

score 154 · Answer 12 · 2012-10-07 23:07:52

154

Views

Is $\{a^m!a^n : n > 0, m > 0, n > m\}$ a context free language?

Published on 07 Oct 2012 - 23:07

score 155 · Answer 13 · 2012-10-08 00:45:29

155

Views

Proving $\{ll^{R}l|l\in\{a,b\}^{*}\}$ is not context free using the pumping lemma

Published on 08 Oct 2012 - 0:45

score 2.6k · Answer 14 · 2012-10-12 09:52:44

2.6k

Views

Design a PDA for the language L={0^n1^n | n>=1}

Published on 12 Oct 2012 - 9:52

score 45 · Answer 15 · 2012-10-14 00:56:32

45

Views

Is the string that is not the concatenation of a single string twice context free?

Published on 14 Oct 2012 - 0:56

List Question

Confusion related to the union of two type 3 grammar

Confusion related to context free grammar

Prove that L(G1) is a regular language

Confirm that this language is context free?

Write a Context Free Grammar for L = {x#y | x =/= reverse of y}

Context free languages closure property $\{a^n b^n : n\geq 0\} \cup \{a^n b^{2n}: n\geq 0\}$

Pushdown automata for the language $\{ w001w^\text{R} : w = \{0,1\}^* \}$

Prove $\{0,1\}^* -\{0^i 1^i\mid i \ge 0\}$ is context free?

Proving that for every context-free language there exist a pushdown automata $M$ s.t. $L=L_{e}(M)$

Proving the context-free languages are closed under reverse

Why is $T \Rightarrow aba$ false, but $T \stackrel{*}{\Rightarrow}$ true?

Is $\{a^m!a^n : n > 0, m > 0, n > m\}$ a context free language?

Proving $\{ll^{R}l|l\in\{a,b\}^{*}\}$ is not context free using the pumping lemma

Design a PDA for the language L={0^n1^n | n>=1}

Is the string that is not the concatenation of a single string twice context free?

Trending Questions

Popular # Hahtags

Popular Questions