The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

In this lecture by Shai Simonson : 
At 33:04 he mentions that "A = CFL that does not accept $\sum^*$ " is Undecidable.
Also, we already know that "A' = CFL that accept $\sum ^*$ " is Undecidable as well.
so if A and A' both are Recursively Enumerable sets, then wouldn't that make A a recursive set ?


closed with the note: Understood
asked in Theory of Computation by Active (2.2k points)
closed by | 57 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

44,317 questions
49,814 answers
65,867 users