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

Q. Which of the functions can a turing machine not perform?

View solution

Q. If T1 and T2 are two turing machines. The composite can be represented using the expression:

View solution

Q. A turing machine has ____________ number of states in a CPU.

View solution

Q. Suppose we have a simple computer with control unit holding a PC with a 32 bit address + Arithmetic unit holding one double length 64 bit Arithmetic Register. The number of states the finite machine will hold:

View solution

Q. State true or false:
Statement: We can use the finite control of turing machine to hold a finite amount of data.

View solution