

MCQOPTIONS
Saved Bookmarks
1. |
Fill in the blank with an appropriate option. |
A. | In automata theory, ___________ is said to be Computationally Universal if can be used to simulate any single taped Turing Machine. |
B. | Computer’s instruction set |
C. | A programming language |
D. | Cellular Automaton |
E. | All of the mentioned |
Answer» E. | |