Question

Prove that every infinite regular language has an undecidable infinite subset

score 2.9k · Answer 1 · 2018-04-26 01:23:30

2.9k

Views

Prove that every infinite regular language has an undecidable infinite subset

Published on 26 Apr 2018 - 1:23

score 310 · Answer 2 · 2018-04-27 13:24:16

310

Views

Application of Rice's Theorem

Published on 27 Apr 2018 - 13:24

score 104 · Answer 3 · 2018-05-01 17:20:57

104

Views

Why is this TM problem decidable

Published on 01 May 2018 - 17:20

score 108 · Answer 4 · 2018-05-16 01:12:31

108

Views

Do given Turing Machines M,N accepts equinumerous languages?

Published on 16 May 2018 - 1:12

score 119 · Answer 5 · 2018-05-20 21:42:08

119

Views

Does solving the complexity class ALL collapse all Turing degrees?

Published on 20 May 2018 - 21:42

score 200 · Answer 6 · 2018-05-21 10:51:14

200

Views

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

Published on 21 May 2018 - 10:51

score 968 · Answer 7 · 2018-05-21 14:32:45

968

Views

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

Published on 21 May 2018 - 14:32

score 171 · Answer 8 · 2018-05-21 16:10:16

171

Views

Decidability if a given expression is equal to a prime number

Published on 21 May 2018 - 16:10

score 681 · Answer 9 · 2018-05-22 20:49:25

681

Views

Prove whether the problem is decidable

Published on 22 May 2018 - 20:49

score 66 · Answer 10 · 2026-02-22 18:14:12

66

Views

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

Published on 22 Feb 2026 - 18:14

score 101 · Answer 11 · 2018-06-03 04:14:35

101

Views

Choosing axiom schemes for a logical theory

Published on 03 Jun 2018 - 4:14

score 261 · Answer 12 · 2026-02-22 18:13:04

261

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 22 Feb 2026 - 18:13

score 252 · Answer 13 · 2018-06-25 13:32:16

252

Views

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

Published on 25 Jun 2018 - 13:32

score 162 · Answer 14 · 2018-06-30 10:38:14

162

Views

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

Published on 30 Jun 2018 - 10:38

score 514 · Answer 15 · 2018-07-21 15:30:30

514

Views

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

Published on 21 Jul 2018 - 15:30

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