Question

Unambiguous Context free grammar for strings in {a,b}* containing at least as many a's as b's

score 345 · Answer 1 · 2019-11-07 19:44:53

345

Views

Unambiguous Context free grammar for strings in {a,b}* containing at least as many a's as b's

Published on 07 Nov 2019 - 19:44

score 322 · Answer 2 · 2019-11-10 19:44:47

322

Views

Is the infinite union of regular languages context free?

Published on 10 Nov 2019 - 19:44

score 56 · Answer 3 · 2019-11-14 02:08:26

56

Views

Provide a grammar for the language: $a^ib^jc^{i+j}:i,j \geq 0$

Published on 14 Nov 2019 - 2:08

score 401 · Answer 4 · 2019-11-16 04:45:31

401

Views

$L = \{a^m b^n c^k \mid \text{ if $(n=k)$ then $(m=n)$}\}$ CFL or CSL?

Published on 16 Nov 2019 - 4:45

score 119 · Answer 5 · 2019-11-17 17:01:07

119

Views

How to prove that a language $K_L$ is context-free based off a regular language $L$

Published on 17 Nov 2019 - 17:01

score 239 · Answer 6 · 2026-03-25 04:43:50

239

Views

Context-free languages are not closed under SWAP$(L) = \{ yxz \mid x, y, z \in \Sigma^{*} $ and $ xyz \in L \}$

Published on 25 Mar 2026 - 4:43

score 2.6k · Answer 7 · 2019-11-20 22:15:42

2.6k

Views

CFG where the number of 0s is the same as the number of 1s and there is exactly one 2.

Published on 20 Nov 2019 - 22:15

score 27 · Answer 8 · 2026-03-25 11:06:28

27

Views

How is there fewer zeros in the left of 1 in this language?

Published on 25 Mar 2026 - 11:06

score 1.6k · Answer 9 · 2019-11-22 20:53:39

1.6k

Views

Concatenation of context-free-language and non-context-free language

Published on 22 Nov 2019 - 20:53

score 51 · Answer 10 · 2019-12-01 12:04:23

51

Views

Finding Context free grammar for L

Published on 01 Dec 2019 - 12:04

score 59 · Answer 11 · 2019-12-01 13:34:28

59

Views

Context free grammar for $L$

Published on 01 Dec 2019 - 13:34

score 39 · Answer 12 · 2019-12-10 09:57:23

39

Views

Context-free grammar for the following language

Published on 10 Dec 2019 - 9:57

score 117 · Answer 13 · 2019-12-11 14:59:06

117

Views

Give a grammar complement to a non-CFL language

Published on 11 Dec 2019 - 14:59

score 38 · Answer 14 · 2019-12-30 18:14:30

38

Views

Do there exist such groups $G$, such that $L(G, A)$ is context-free, but $(A \cup A^{-1})^* \setminus L(G, A)$ isn't?

Published on 30 Dec 2019 - 18:14

score 302 · Answer 15 · 2020-01-03 13:19:17

302

Views

Build CFG for $L=\{a^ib^kc^i| \,(i+k)\equiv1 \pmod 3\}$

Published on 03 Jan 2020 - 13:19

List Question

Unambiguous Context free grammar for strings in {a,b}* containing at least as many a's as b's

Is the infinite union of regular languages context free?

Provide a grammar for the language: $a^ib^jc^{i+j}:i,j \geq 0$

$L = \{a^m b^n c^k \mid \text{ if $(n=k)$ then $(m=n)$}\}$ CFL or CSL?

How to prove that a language $K_L$ is context-free based off a regular language $L$

Context-free languages are not closed under SWAP$(L) = \{ yxz \mid x, y, z \in \Sigma^{*} $ and $ xyz \in L \}$

CFG where the number of 0s is the same as the number of 1s and there is exactly one 2.

How is there fewer zeros in the left of 1 in this language?

Concatenation of context-free-language and non-context-free language

Finding Context free grammar for L

Context free grammar for $L$

Context-free grammar for the following language

Give a grammar complement to a non-CFL language

Do there exist such groups $G$, such that $L(G, A)$ is context-free, but $(A \cup A^{-1})^* \setminus L(G, A)$ isn't?

Build CFG for $L=\{a^ib^kc^i| \,(i+k)\equiv1 \pmod 3\}$

Trending Questions

Popular # Hahtags

Popular Questions