Q. In what ratio, more computation time is needed to simulate multitape turing machines using single tape turing machines?

View solution

Q. Which of the following is true for two stack turing machines?

View solution

Q. Which of the following is not a Non deterministic turing machine?

View solution

Q. Which of the turing machines have existential and universal states?

View solution

Q. Which of the following is false for Quantum Turing machine?

View solution

Q. A deterministic turing machine is:

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. Are Multitape and Multitrack turing machines same?

View solution

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

View solution

Q. Which of the following does not exists?

View solution

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

View solution

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

View solution

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

View solution

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?

View solution

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

View solution