MCQOPTIONS
Home
About Us
Contact Us
Bookmark
Saved Bookmarks
Testing Subject
General Aptitude
Logical and Verbal Reasoning
English Skills Ability
Technical Programming
Current Affairs
General Knowledge
Finance & Accounting
GATE (Mechanical Engineering)
Chemical Engineering
→
Automata Theory
→
Non Deterministic Turing Machines
→
Recursive languages are also known as:
1.
Recursive languages are also known as:
A.
decidable
B.
undecidable
C.
sometimes decidable
D.
none of the mentioned
Answer» B. undecidable
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
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies