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) question asks: Select the correct name for: a finite-state machine whose output values are determined solely by its current state. The correct choice is C. Moore machine. Read the options below, commit to one, then use the explanation to see why that choice holds and why the others do not.
Theory of Computation (Automata) items like this one are written for Pakistan exams such as CSS, FPSC, PPSC, and NTS. The difficulty label is a hint about how much of the topic the stem assumes, not a score. Tags and exam names, when they are present, tell you where else the same idea is tested. Previous and next links stay in Theory of Computation (Automata) so you can continue the subject. Related questions point at nearby stems if you want another angle on the same idea.
Treat the explanation as part of the question, not a footnote. If you missed it, reread the stem against the correct option before you open the next Theory of Computation (Automata) item. A timed quiz is the same pool with a clock and a score. A past paper is a full sitting rather than this single question.
- A. Recursively enumerable language
Why not A: “Recursively enumerable language” does not fit this question. The answer is Moore machine.
- B. DFA-NFA equivalence
Why not B: “DFA-NFA equivalence” does not fit this question. The answer is Moore machine.
- C. Moore machine ✓
- D. Pumping lemma
Why not D: “Pumping lemma” does not fit this question. The answer is Moore machine.
Correct answer
C. Moore machine
Explanation
Moore machine (option C) is the accepted answer to “Select the correct name for: a finite-state machine whose output values are determined solely by its current state.”. Option A (Recursively enumerable language) does not fit this question. Option B (DFA-NFA equivalence) does not fit this question. Option D (Pumping lemma) does not fit this question. For this Theory of Computation (Automata) question, the accepted answer is Moore machine.
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.