Question
a.
Halting problem
b.
Boolean Satisfiability problem
c.
both a and b
d.
None of the mentioned
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which of the problems are unsolvable?
Similar Questions
Discover Related MCQs
Q. Which of the following a turing machine does not consist of?
View solution
Q. The value of n if turing machine is defined using n-tuples:
View solution
Q. If d is not defined on the current state and the current tape symbol, then the machine ______
View solution
Q. Statement: Instantaneous descriptions can be designed for a Turing machine.
State true or false:
View solution
Q. Which of the following are the models equivalent to Turing machine?
View solution
Q. Which among the following is incorrect for o-machines?
View solution
Q. RASP stands for:
View solution
Q. Which of the following is not true about RASP?
View solution
Q. State true or false:
Statement: RASP is to RAM like UTM is to turing machine.
View solution
Q. The class of recursively ennumerable language is known as:
View solution
Q. A language L is said to be Turing decidable if:
View solution
Q. Which of the following statements are false?
View solution
Q. Choose the correct option:
Statement: If L1 and L2 are recursively ennumerable languages over S, then the following is/are recursively ennumerable.
View solution
Q. If L is a recursive language, L’ is:
View solution
Q. Choose the appropriate option:
Statement: If a language L is recursive, it is closed under the following operations:
View solution
Q. A recursively ennumerable language L can be recursive if:
View solution
Q. State true or false:
Statement: An ennumerator is a turing machine m with extra output tape T, where symbols, once written, are never changed.
View solution
Q. A Language L may not be accepted by a Turing Machine if:
View solution
Q. The machine accept the string by entering into hA or it can:
View solution
Q. Which of the following can accept even palindrome over {a,b}
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!