Question

Prove that every infinite regular language has an undecidable infinite subset

score 2.9k · Answer 1 · 2026-02-22 23:36:15

2.9k

Views

Prove that every infinite regular language has an undecidable infinite subset

Published on 22 Feb 2026 - 23:36

score 313 · Answer 2 · 2026-04-01 03:22:07

313

Views

Application of Rice's Theorem

Published on 01 Apr 2026 - 3:22

score 107 · Answer 3 · 2026-04-01 08:09:53

107

Views

Why is this TM problem decidable

Published on 01 Apr 2026 - 8:09

score 110 · Answer 4 · 2026-03-17 21:48:55

110

Views

Do given Turing Machines M,N accepts equinumerous languages?

Published on 17 Mar 2026 - 21:48

score 121 · Answer 5 · 2026-03-17 19:14:46

121

Views

Does solving the complexity class ALL collapse all Turing degrees?

Published on 17 Mar 2026 - 19:14

score 201 · Answer 6 · 2026-02-22 23:35:57

201

Views

Does double negation elimination hold for decidable formulae in intuitionistic logic?

Published on 22 Feb 2026 - 23:35

score 969 · Answer 7 · 2026-02-22 23:35:11

969

Views

Is it semi-decidable whether a context-free grammar generates a regular language?

Published on 22 Feb 2026 - 23:35

score 173 · Answer 8 · 2026-03-17 18:38:36

173

Views

Decidability if a given expression is equal to a prime number

Published on 17 Mar 2026 - 18:38

score 683 · Answer 9 · 2026-03-17 09:08:46

683

Views

Prove whether the problem is decidable

Published on 17 Mar 2026 - 9:08

score 79 · Answer 10 · 2026-04-02 20:12:58

79

Views

Is the semidecidability of the valid formula of second order logic dependent upon the semantic?

Published on 02 Apr 2026 - 20:12

score 114 · Answer 11 · 2026-04-05 02:38:17

114

Views

Choosing axiom schemes for a logical theory

Published on 05 Apr 2026 - 2:38

score 276 · Answer 12 · 2026-04-03 08:39:57

276

Views

A axiomatization of (full) Second Order Logic with a decidable proof system cannot be complete; is this true if we only require semi-decidability?

Published on 03 Apr 2026 - 8:39

score 253 · Answer 13 · 2026-02-22 23:39:07

253

Views

Is any context-free grammar in Chomsky form with at most 2017 rules necessarily finite?

Published on 22 Feb 2026 - 23:39

score 169 · Answer 14 · 2026-04-07 10:21:57

169

Views

Is there a semi-decidable statement equivalent to the Collatz-conjecture?

Published on 07 Apr 2026 - 10:21

score 515 · Answer 15 · 2026-02-22 23:41:56

515

Views

Prove the theory of equality with a finite number of unary predicates is decidable

Published on 22 Feb 2026 - 23:41

List Question

Prove that every infinite regular language has an undecidable infinite subset

Application of Rice's Theorem

Why is this TM problem decidable

Do given Turing Machines M,N accepts equinumerous languages?

Does solving the complexity class ALL collapse all Turing degrees?

Does double negation elimination hold for decidable formulae in intuitionistic logic?

Is it semi-decidable whether a context-free grammar generates a regular language?

Decidability if a given expression is equal to a prime number

Prove whether the problem is decidable

Is the semidecidability of the valid formula of second order logic dependent upon the semantic?

Choosing axiom schemes for a logical theory

A axiomatization of (full) Second Order Logic with a decidable proof system cannot be complete; is this true if we only require semi-decidability?

Is any context-free grammar in Chomsky form with at most 2017 rules necessarily finite?

Is there a semi-decidable statement equivalent to the Collatz-conjecture?

Prove the theory of equality with a finite number of unary predicates is decidable

Trending Questions

Popular # Hahtags

Popular Questions