Question

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:

(a) 2^(32*64)

(b) 2^96

(c) 96

(d) 32

This question was posed to me in examination.

Question is from Programming Techniques-Storage and Subroutines topic in chapter Introduction to Turing Machines of Automata Theory

Answer 1

The correct answer is (b) 2^96

Easy explanation: According to the statistics of the question, we will have a finite machine with 2^96 states.