ACtE07 · Chapter 7Theory of Computation & Graphics🏛️ Past Licensure QuestionID: 28c73973
A Deterministic Turing Machine (DTM) is mathematically defined as a(n):
A Deterministic Turing Machine (DTM) is mathematically defined as a(n):
Multiple Choice Options
- A
Ambiguous Turing machine
- B✓ Correct Option
Unambiguous Turing machine
- C
Non-deterministic Turing machine
- D
None of the mentioned
Detailed Technical Solution & Explanation
In formal language theory, a Deterministic Turing Machine has a transition function that yields at most one transition for any given state and tape symbol pair . Because every step has at most one unique successor, it is unambiguous.
Option Analysis:
•
Option A (Ambiguous Turing machine): Ambiguity implies multiple valid computational paths or derivations for the same input, which contradicts determinism.
•
Option B (Unambiguous Turing machine): Correct. For every configuration of a DTM, at most one move is possible, making its transition sequence unambiguous.
•
Option C (Non-deterministic Turing machine): An NTM allows a set of possible transitions from a given state and tape symbol.
•
Option D (None of the mentioned): Incorrect since unambiguous accurately describes a deterministic machine.
Reference: Mock Test 01NEC Licensure Syllabus