Question

How to disprove that the union of all non-context-free languages over $a$ is also non-context-free language?

score 79 · Answer 1 · 2019-01-24 16:48:41

79

Views

How to disprove that the union of all non-context-free languages over $a$ is also non-context-free language?

Published on 24 Jan 2019 - 16:48

score 491 · Answer 2 · 2026-03-25 01:22:32

491

Views

context free language prove or disprove

Published on 25 Mar 2026 - 1:22

score 271 · Answer 3 · 2019-02-14 07:22:55

271

Views

concatenation of 2 non-context-free languages that is context-free but not regular

Published on 14 Feb 2019 - 7:22

score 53 · Answer 4 · 2026-03-14 19:45:28

53

Views

what is the mapping reduction of $A_{TM}$ to $\overline{CF_{TM}}$

Published on 14 Mar 2026 - 19:45

score 198 · Answer 5 · 2019-04-10 18:14:50

198

Views

prove/disprove: If the language $L$ is such that for every $CFL$ $L'$ , the language $L \cap L'$ is $CFL$, then $L$ is regular?

Published on 10 Apr 2019 - 18:14

score 82 · Answer 6 · 2019-04-16 15:15:56

82

Views

Closure of regular languages to $A(L)=\{zyx|x,y,z \in \{0,1\}^*, xyz \in L\}$

Published on 16 Apr 2019 - 15:15

score 79 · Answer 7 · 2019-04-25 09:08:00

Prove that any string formed from the alphabet {0, 1} that has an equal amount of 0's and 1's can always be written as 0x1y or 1x0y

score 223 · Answer 8 · 2026-03-22 20:20:34

223

Views

Construct a CFG grammar that generates this language

Published on 22 Mar 2026 - 20:20

score 59 · Answer 9 · 2026-03-25 02:57:51

59

Views

Proving a Context Free Language

Published on 25 Mar 2026 - 2:57

score 970 · Answer 10 · 2026-03-25 03:04:07

970

Views

Is this enough to prove that the language L is not context-free? (Pumping lemma for CFL's)

Published on 25 Mar 2026 - 3:04

score 215 · Answer 11 · 2019-05-06 17:08:00

215

Views

PDA for this CFL $L=\{a^i b^j c^k, k=i*j, i,j=0,1,2...\}$

Published on 06 May 2019 - 17:08

score 31 · Answer 12 · 2019-05-07 08:02:56

31

Views

Describing indefinitely nested language generated by Context-Free Grammar

Published on 07 May 2019 - 8:02

score 166 · Answer 13 · 2026-03-25 02:58:49

166

Views

L = { u#w | u != w} context-free

Published on 25 Mar 2026 - 2:58

score 69 · Answer 14 · 2026-03-23 08:09:39

69

Views

Prove that L = $ \{wuv \mid w + u = v\}$ is not context free where w, u, v is interpreted as ordinary integers.

Published on 23 Mar 2026 - 8:09

score 80 · Answer 15 · 2026-03-21 23:27:05

80

Views

Using group presentation, does $\langle A = a^3, 1 = A^2 \rangle$ relate to $\langle A = a^2, 1 = A^3\rangle$?

Published on 21 Mar 2026 - 23:27

List Question

How to disprove that the union of all non-context-free languages over $a$ is also non-context-free language?

context free language prove or disprove

concatenation of 2 non-context-free languages that is context-free but not regular

what is the mapping reduction of $A_{TM}$ to $\overline{CF_{TM}}$

prove/disprove: If the language $L$ is such that for every $CFL$ $L'$ , the language $L \cap L'$ is $CFL$, then $L$ is regular?

Closure of regular languages to $A(L)=\{zyx|x,y,z \in \{0,1\}^*, xyz \in L\}$

Prove that any string formed from the alphabet {0, 1} that has an equal amount of 0's and 1's can always be written as 0x1y or 1x0y

Construct a CFG grammar that generates this language

Proving a Context Free Language

Is this enough to prove that the language L is not context-free? (Pumping lemma for CFL's)

PDA for this CFL $L=\{a^i b^j c^k, k=i*j, i,j=0,1,2...\}$

Describing indefinitely nested language generated by Context-Free Grammar

L = { u#w | u != w} context-free

Prove that L = $ \{wuv \mid w + u = v\}$ is not context free where w, u, v is interpreted as ordinary integers.

Using group presentation, does $\langle A = a^3, 1 = A^2 \rangle$ relate to $\langle A = a^2, 1 = A^3\rangle$?

Trending Questions

Popular # Hahtags

Popular Questions