Question

Converting Grammar to Chomsky Normal Form

score 101 · Answer 1 · 2022-04-01 10:14:45

101

Views

Converting Grammar to Chomsky Normal Form

Published on 01 Apr 2022 - 10:14

score 832 · Answer 2 · 2026-03-25 21:49:38

832

Views

Failure of context-free pumping lemma of $a^nb^n$

Published on 25 Mar 2026 - 21:49

score 169 · Answer 3 · 2026-03-25 21:54:08

169

Views

Pumping lemma: if you pump to $uv^0wx^0y$, wouldn't $|vx| \ngeq 1$?

Published on 25 Mar 2026 - 21:54

score 180 · Answer 4 · 2022-04-15 16:15:25

180

Views

Writing a grammar that creates a specific language from a given grammar in Chomsky normal form

Published on 15 Apr 2022 - 16:15

score 381 · Answer 5 · 2022-04-17 17:16:21

Find a CFG for all the binary strings in which the characters in $i$ and $i + 2$ positions are same, and the length of the string is at least 2.

score 75 · Answer 6 · 2022-04-18 00:10:54

75

Views

Solution Verification: Suggest a context-free grammar that creates this language.

Published on 18 Apr 2022 - 0:10

score 963 · Answer 7 · 2022-04-18 05:48:30

963

Views

Convert a CFG to GNF

Published on 18 Apr 2022 - 5:48

score 202 · Answer 8 · 2022-05-01 18:27:09

202

Views

On the general relationship between automata, expressions, and grammars

Published on 01 May 2022 - 18:27

score 23 · Answer 9 · 2022-05-03 05:13:52

23

Views

What does the ⇒ mean in Context Free Grammer? Also, how do I derive/get the L(CFG) from a CFG?

Published on 03 May 2022 - 5:13

score 218 · Answer 10 · 2022-05-24 15:00:15

218

Views

Is there a s-grammar for $L_2=\{a^nb^m, n > m \ge 0\}$?

Published on 24 May 2022 - 15:00

score 479 · Answer 11 · 2022-05-31 16:04:22

479

Views

Proof Attempt: non Context free languages and non regular language with some words added stay non regular/context-free.

Published on 31 May 2022 - 16:04

score 1.1k · Answer 12 · 2026-03-25 21:49:05

1.1k

Views

My proof of $\{a^p|p\mathbb{isprime}\}$ is not a CFL.

Published on 25 Mar 2026 - 21:49

score 62 · Answer 13 · 2022-06-09 17:42:38

62

Views

Is it possible to create this context-free grammatic?

Published on 09 Jun 2022 - 17:42

score 92 · Answer 14 · 2026-03-25 21:47:57

92

Views

How to prove that a language is not context-free using pumping lemma?

Published on 25 Mar 2026 - 21:47

score 62 · Answer 15 · 2022-06-24 17:02:06

62

Views

Creating a context free grammar for this language. (Having difficulties keeping track of $3$ parts).

Published on 24 Jun 2022 - 17:02

List Question

Converting Grammar to Chomsky Normal Form

Failure of context-free pumping lemma of $a^nb^n$

Pumping lemma: if you pump to $uv^0wx^0y$, wouldn't $|vx| \ngeq 1$?

Writing a grammar that creates a specific language from a given grammar in Chomsky normal form

Find a CFG for all the binary strings in which the characters in $i$ and $i + 2$ positions are same, and the length of the string is at least 2.

Solution Verification: Suggest a context-free grammar that creates this language.

Convert a CFG to GNF

On the general relationship between automata, expressions, and grammars

What does the ⇒ mean in Context Free Grammer? Also, how do I derive/get the L(CFG) from a CFG?

Is there a s-grammar for $L_2=\{a^nb^m, n > m \ge 0\}$?

Proof Attempt: non Context free languages and non regular language with some words added stay non regular/context-free.

My proof of $\{a^p|p\mathbb{isprime}\}$ is not a CFL.

Is it possible to create this context-free grammatic?

How to prove that a language is not context-free using pumping lemma?

Creating a context free grammar for this language. (Having difficulties keeping track of $3$ parts).

Trending Questions

Popular # Hahtags

Popular Questions