The Gateway to Computer Science Excellence
0 votes
17 views

We know by Rice's theorem that none of the following problems are decidable. However are they recursively enumerable,or non-RE?

  1. Does $L(M)$ contain at least two strings?
  2. Is $L(M)$ infinite?
  3. Is $L(M)$ a context-free language?
  4. Is $L(M) = (L(M))^{R}$?
in Theory of Computation by Veteran (58.8k points) | 17 views

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,292 answers
198,221 comments
104,908 users