adplus-dvertising
frame-decoration

Question

A deterministic turing machine is:

a.

ambiguous turing machine

b.

unambiguous turing machine

c.

non-deterministic

d.

none of the mentioned

Answer: (b).unambiguous turing machine

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. A deterministic turing machine is:

Similar Questions

Discover Related MCQs

Q. Which of the following is true about Turing’s a-machine?

Q. Which of the following is a multi tape turing machine?

Q. Which of the following are related to construction of One Tape turing machines?

Q. Which of the following topics cannot be covered using JFLAPS?

Q. State true or false:
Statement: Multitape turing machine have multi tapes where each tape is accessed with one head.

Q. Which of the following statements is/are true?

Q. Are Multitape and Multitrack turing machines same?

Q. In a n-track turing machine, _________ head/heads read and write on all tracks simultaneously.

Q. Which of the following does not exists?

Q. Can a multitape turing machine have an infinte number of tapes?

Q. Every language accepted by a k-tape TM is _____ by a single-tape TM.

Q. Which of the following is/are a basic TM equivalent to?

Q. X is a simple mathematical model of a computer. X has unrestricted and unlimited memory. X is a FA with R/W head. X can have an infinite tape divided into cells, each cell holding one symbol.
Name X?

Q. Which of the following is/are not an application of turing machine?

Q. State true or false:
Statement: Turing Machine can change symbols on its tape, whereas the FA cannot change symbols on tape.

Q. Which of the following cannot be a possibility of a TM while it processes an input?

Q. Pick the odd one out.

Q. Which among the following is not true for 2-way infinte TM?

Q. Can a turing machine act like a transducer?

Q. Enumerator is a turing machine with __________