Theory of Computation (Automata)
Select the correct name for: a finite-state machine whose output values are determined solely by its current state.
Difficulty: Hard
About this MCQ
This Hard Theory of Computation (Automata) MCQ checks one syllabus fact.
The question is: “Select the correct name for: a finite-state machine whose output values are determined solely by its current state.”
The accepted answer is C. Moore machine. “Select the correct name for: a finite-state machine whose output values are determined solely by its current state.” is answered by Moore machine (option C). Option A (“Recursively enumerable language”) does not match the stem; it is a near-miss used to catch incomplete recall of Moore machine. Option B (“DFA-NFA equivalence”) does not match the stem; it is a near-miss used to catch incomplete recall of Moore machine. Remaining alternatives (Pumping lemma) fall outside the same rule and should be eliminated once Moore machine is identified. Theory of Computation (Automata) questions of this type reward precise definitions rather than approximate associations. Theory of Computation (Automata) recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.
- A. Recursively enumerable language
Why not A: “Recursively enumerable language” is not correct. The accepted answer is C. Moore machine. “Select the correct name for: a finite-state machine whose output values are determined solely by its current state.” is answered by Moore machine (option C). Option A (“Recursivel
- B. DFA-NFA equivalence
Why not B: “DFA-NFA equivalence” is not correct. The accepted answer is C. Moore machine. “Select the correct name for: a finite-state machine whose output values are determined solely by its current state.” is answered by Moore machine (option C). Option A (“Recursivel
- C. Moore machine ✓
- D. Pumping lemma
Why not D: “Pumping lemma” is not correct. The accepted answer is C. Moore machine. “Select the correct name for: a finite-state machine whose output values are determined solely by its current state.” is answered by Moore machine (option C). Option A (“Recursivel
Correct answer
C. Moore machine
Explanation
“Select the correct name for: a finite-state machine whose output values are determined solely by its current state.” is answered by Moore machine (option C). Option A (“Recursively enumerable language”) does not match the stem; it is a near-miss used to catch incomplete recall of Moore machine. Option B (“DFA-NFA equivalence”) does not match the stem; it is a near-miss used to catch incomplete recall of Moore machine. Remaining alternatives (Pumping lemma) fall outside the same rule and should be eliminated once Moore machine is identified. Theory of Computation (Automata) questions of this type reward precise definitions rather than approximate associations. Theory of Computation (Automata) recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.
Source: Theory of Computation (Automata) Official Reference Guide
Tags: computer science, automata theory, theory of computation, formal languages
Submitted by: MCQsHub Editorial
Related MCQs
- What term describes the following? a property used to prove that certain languages are not regular by showing...
- Identify the correct definition of Universal Turing machine.
- The concept in which a Turing machine capable of simulating any other Turing machine given its description and...
- What is the function or purpose of Ambiguous grammar?
- Which of the following best names the concept in which a grammar for which some string can be generated by mor...
- Choose the correct description of Derivation.