The Gateway to Computer Science Excellence
0 votes
8 views
Let $L$ be recursively enumerable and let $\overline{L}$ be non-RE. Consider the language

$L' = \left\{0w\mid w\ \text{is in}\ L \right\}$

Can you say for certain whether $L'$ or its complement are recursive, RE, or non-RE? Justify your answer.
in Theory of Computation by Veteran (54.8k points) | 8 views

Please log in or register to answer this question.

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,647 questions
56,473 answers
195,393 comments
100,370 users