MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
Which among the following are semi decidable?..
1.
Which among the following are semi decidable?
A.
Empty-DFA
B.
Rec-NFA
C.
Infinite-DFA
D.
All of the mentioned
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
The class of recursive language is known as:
Recursive languages are also known as:
A formal language is recursive if :
A problem is called __________ if its has an efficient algorithm for itself.
An algorithm is called efficient if it runs in ____________ time on a serial computer.
The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:
Decidable can be taken as a synonym to:
The language accepted by a turing machine is called ____________
Which among the following are semi decidable?
Which among the following are undecidable theories?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply