Theory of Computation (Automata)
Which term refers to an abstract machine with a finite number of states used to recognize patterns in input strings?
Difficulty: Medium
About this MCQ
This Medium Theory of Computation (Automata) question asks: Which term refers to an abstract machine with a finite number of states used to recognize patterns in input strings? The correct choice is A. Finite automaton. 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. Finite automaton ✓
- B. Halting problem
Why not B: “Halting problem” does not fit this question. The answer is Finite automaton.
- C. Context-free grammar
Why not C: “Context-free grammar” does not fit this question. The answer is Finite automaton.
- D. State transition diagram
Why not D: “State transition diagram” does not fit this question. The answer is Finite automaton.
Correct answer
A. Finite automaton
Explanation
Finite automaton is the term that matches “Which term refers to an abstract machine with a finite number of states used to recognize patterns in input strings” (option A). Option B (Halting problem) does not fit this question. Option C (Context-free grammar) does not fit this question. Option D (State transition diagram) does not fit this question. For this Theory of Computation (Automata) question, the accepted answer is Finite automaton.
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 is the name for a finite automaton where each state has exactly one transition for each possible input sy...
- Which of the following best describes Deterministic finite automaton (DFA)?
- Identify the correct concept described as: a finite automaton that may have multiple possible transitions for...
- Non-deterministic finite automaton (NFA) is best defined as which of the following?
- A sequence of characters that defines a search pattern, corresponding to regular languages. What is this conce...
- Choose the correct description of Regular expression.