MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
Statement: If L id R.E., L
c
needs to be..
1.
Statement: If L id R.E., L
c
needs to be R.E. Is it correct?
A.
Yes
B.
No
C.
Maybe
D.
Cannot predict
Answer» C. Maybe
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
With reference to binary strings, state true or false:<br>Statement: For any turing machine, the input alphabet is restricted to {0,1}.
Which of the following is true for The Halting problem?
Statement: If L id R.E., L<sup>c</sup> needs to be R.E. Is it correct?
<p>7.Which one of the following is true for the given?<br>A={(M,w)|M is a turing machine that accepts string w}
Which of the following are decidable problems?
Which of the following technique is used to find whether a natural language isn t recursive enumerable?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply