AMA University Answers
Login
Register
AMA OED
Courses
CS
CS-6205
If L is recursively enumerable...
If L is recursively enumerable then ________________.
none of the choices given is correct
L is also recursively enumerable
L is definitely not recursively enumerable
L may not be recursively enumerable
Correct
Similar CS-6205 questions
If we can successfully and ly stimulate a TM with storage by two standard TMs, then
If L1 and L2 are regular sets then intersection of these two will be.