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