Question

Converting a long CFG to Chomsky Normal Form

score 115 · Answer 1 · 2014-10-28 00:23:00

115

Views

Converting a long CFG to Chomsky Normal Form

Published on 28 Oct 2014 - 0:23

score 689 · Answer 2 · 2014-10-29 01:16:20

689

Views

Is it possible to build an Pushdown Automata for an Ambiguous Context-Free Grammar?

Published on 29 Oct 2014 - 1:16

score 284 · Answer 3 · 2014-11-09 17:53:58

284

Views

Pumping Lemma for Context Free Languages: Is this language CFL?

Published on 09 Nov 2014 - 17:53

score 764 · Answer 4 · 2014-11-12 02:23:27

764

Views

How to Determine which language is guaranteed to be a deterministic Context-Free Language

Published on 12 Nov 2014 - 2:23

score 36 · Answer 5 · 2014-11-14 23:38:03

36

Views

Induction for quantified statement with two discrete parameters

Published on 14 Nov 2014 - 23:38

score 240 · Answer 6 · 2014-11-16 01:23:06

240

Views

context free grammar production rules

Published on 16 Nov 2014 - 1:23

score 19 · Answer 7 · 2014-11-19 17:19:22

19

Views

How do I know how many times to repeat a replacement when generating a grammar?

Published on 19 Nov 2014 - 17:19

score 2.9k · Answer 8 · 2014-11-22 01:34:00

For $\Sigma = \{ 0,1 \}$, $A$ has strings which contain a $1$ in their middle third, and a $B$ which contain two $1$'s in their middle third.

score 5.6k · Answer 9 · 2014-11-23 04:11:49

5.6k

Views

prove the complement of a language is context free

Published on 23 Nov 2014 - 4:11

score 1.4k · Answer 10 · 2014-11-23 17:55:58

1.4k

Views

Construct context free grammar which generates following language $\{wcw^R\in\{a, b, c\}^\mid w\in\{a, b, c\}^ \}$

Published on 23 Nov 2014 - 17:55

score 4.4k · Answer 11 · 2014-11-24 00:56:01

4.4k

Views

How to construct a context free grammar that generate following language. $\{a^nb^nc^k \in \{a,b,c\}^* | n,k >= 0\} $

Published on 24 Nov 2014 - 0:56

score 252 · Answer 12 · 2014-11-30 19:42:37

252

Views

Prove or disprove: $L^2$ context free implies $L$ is context free.

Published on 30 Nov 2014 - 19:42

score 725 · Answer 13 · 2014-12-04 11:10:09

725

Views

How to design a Context-Free Grammar and Pushdown Automaton for the following language:

Published on 04 Dec 2014 - 11:10

score 2.3k · Answer 14 · 2014-12-04 20:27:22

2.3k

Views

Construct a PDA to accept the language

Published on 04 Dec 2014 - 20:27

score 915 · Answer 15 · 2014-12-05 16:09:56

915

Views

Can 2 items be added/taken away from a stack in push down automata at once?

Published on 05 Dec 2014 - 16:09

List Question

Converting a long CFG to Chomsky Normal Form

Is it possible to build an Pushdown Automata for an Ambiguous Context-Free Grammar?

Pumping Lemma for Context Free Languages: Is this language CFL?

How to Determine which language is guaranteed to be a deterministic Context-Free Language

Induction for quantified statement with two discrete parameters

context free grammar production rules

How do I know how many times to repeat a replacement when generating a grammar?

For $\Sigma = \{ 0,1 \}$, $A$ has strings which contain a $1$ in their middle third, and a $B$ which contain two $1$'s in their middle third.

prove the complement of a language is context free

Construct context free grammar which generates following language $\{wcw^R\in\{a, b, c\}^\mid w\in\{a, b, c\}^ \}$

How to construct a context free grammar that generate following language. $\{a^nb^nc^k \in \{a,b,c\}^* | n,k >= 0\} $

Prove or disprove: $L^2$ context free implies $L$ is context free.

How to design a Context-Free Grammar and Pushdown Automaton for the following language:

Construct a PDA to accept the language

Can 2 items be added/taken away from a stack in push down automata at once?

Trending Questions

Popular # Hahtags

Popular Questions