Question
a.
yes w ∈ L
b.
no w ∉ L
c.
M does not halt w ∉ L
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. A language L is recursively ennumerable if L=L(M) for some turing machine M. Which among the following cannot be among A, B and C?
Similar Questions
Discover Related MCQs
Q. Which of the following regular expression resembles the given diagram?
View solution
Q. d(q,X)=(r,Y,D) where D cannot be:
View solution
Q. The following turing machine acts like:
View solution
Q. What does the following transition graph shows:
View solution
Q. In one move a turing machine will:
View solution
Q. A turing machine is a
View solution
Q. A turing machine operates over:
View solution
Q. Which of the functions are not performed by the turing machine after reading a symbol?
View solution
Q. ‘a’ in a-machine is :
View solution
Q. Which of the problems were not answered when the turing machine was invented?
View solution
Q. The ability for a system of instructions to simulate a Turing Machine is called _________
View solution
Q. Turing machine can be represented using the following tools:
View solution
Q. Which of the following is false for an abstract machine?
View solution
Q. Fill in the blank with the most appropriate option.
Statement: In theory of computation, abstract machines are often used in ___________ regarding computability or to analyze the complexity of an algorithm.
View solution
Q. State true or false:
Statement: RAM model allows random access to indexed memory locations.
View solution
Q. A turing machine that is able to simulate other turing machines:
View solution
Q. Which of the problems are unsolvable?
View solution
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
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!