Question

Pumping Lemma for CF language exercise

score 242 · Answer 1 · 2026-03-25 05:58:56

242

Views

Pumping Lemma for CF language exercise

Published on 25 Mar 2026 - 5:58

score 45 · Answer 2 · 2026-03-25 04:44:25

45

Views

A new language construction

Published on 25 Mar 2026 - 4:44

score 108 · Answer 3 · 2026-03-26 06:28:25

108

Views

How to prove that there is closure in NP for the reverse operation on strings?

Published on 26 Mar 2026 - 6:28

score 105 · Answer 4 · 2026-03-26 15:16:29

105

Views

Analogue of Turing recognizable languages

Published on 26 Mar 2026 - 15:16

score 124 · Answer 5 · 2026-03-25 06:06:23

124

Views

Isn't it problematic to cite the Gödel sentence as a proposition asserting 'This sentence is unprovable' since it isn't really on point?

Published on 25 Mar 2026 - 6:06

score 451 · Answer 6 · 2016-07-16 13:15:41

451

Views

Why does this proof of reverse of string is correct?

Published on 16 Jul 2016 - 13:15

score 1.7k · Answer 7 · 2026-03-27 17:06:29

1.7k

Views

There exists a regular language A such that for all languages B, A ∩ B is regular.

Published on 27 Mar 2026 - 17:06

score 314 · Answer 8 · 2026-03-26 15:16:25

314

Views

I understand Turing Machine things about languages but I don't understand same things about problems and their inputs

Published on 26 Mar 2026 - 15:16

score 71 · Answer 9 · 2026-03-26 08:02:34

71

Views

Question on a proof involving linked pairs and Green's relations. Characterisation of conjugacy of linked pairs

Published on 26 Mar 2026 - 8:02

score 62 · Answer 10 · 2026-03-26 02:57:56

62

Views

Construct a grammar for $L=\{a^k b^l \ldots a^k b^l : k\geq 2 , l\geq 1\text{ and }a^k b^l \text{ is repeated at least once}\}$

Published on 26 Mar 2026 - 2:57

score 84 · Answer 11 · 2026-03-26 14:21:16

84

Views

Another formulation of the Wadge lemma in terms of incomparable Wadge classes

Published on 26 Mar 2026 - 14:21

score 371 · Answer 12 · 2026-02-23 06:21:48

371

Views

Question on proof that Gale-Stewart game is determined for open sets

Published on 23 Feb 2026 - 6:21

score 104 · Answer 13 · 2026-03-27 10:11:31

104

Views

CFG and Regularity of Two Language?

Published on 27 Mar 2026 - 10:11

score 241 · Answer 14 · 2016-08-12 08:54:26

241

Views

Show that the language is undecidable

Published on 12 Aug 2016 - 8:54

score 255 · Answer 15 · 2026-03-26 04:36:32

255

Views

Does the fact that $L_1L_2$ and $L_2L_1$ are both regular imply that at least one between $L_1$ and $L_2$ is regular?

Published on 26 Mar 2026 - 4:36

List Question

Pumping Lemma for CF language exercise

A new language construction

How to prove that there is closure in NP for the reverse operation on strings?

Analogue of Turing recognizable languages

Isn't it problematic to cite the Gödel sentence as a proposition asserting 'This sentence is unprovable' since it isn't really on point?

Why does this proof of reverse of string is correct?

There exists a regular language A such that for all languages B, A ∩ B is regular.

I understand Turing Machine things about languages but I don't understand same things about problems and their inputs

Question on a proof involving linked pairs and Green's relations. Characterisation of conjugacy of linked pairs

Construct a grammar for $L=\{a^k b^l \ldots a^k b^l : k\geq 2 , l\geq 1\text{ and }a^k b^l \text{ is repeated at least once}\}$

Another formulation of the Wadge lemma in terms of incomparable Wadge classes

Question on proof that Gale-Stewart game is determined for open sets

CFG and Regularity of Two Language?

Show that the language is undecidable

Does the fact that $L_1L_2$ and $L_2L_1$ are both regular imply that at least one between $L_1$ and $L_2$ is regular?

Trending Questions

Popular # Hahtags

Popular Questions