Theory of Computation (Automata)
Which of the following best names the concept in which an automaton that uses a stack to recognize context-free languages?
Difficulty: Hard
About this MCQ
This Hard Theory of Computation (Automata) question asks: Which of the following best names the concept in which an automaton that uses a stack to recognize context-free languages? The correct choice is B. Pushdown 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. Regular expression
Why not A: “Regular expression” does not fit this question. The answer is Pushdown automaton.
- B. Pushdown automaton ✓
- C. Finite automaton
Why not C: “Finite automaton” does not fit this question. The answer is Pushdown automaton.
- D. Chomsky hierarchy
Why not D: “Chomsky hierarchy” does not fit this question. The answer is Pushdown automaton.
Correct answer
B. Pushdown automaton
Explanation
Pushdown automaton is the term that matches “Which of the following best names the concept in which an automaton that uses a stack to recognize context-free languages” (option B). Option A (Regular expression) does not fit this question. Option C (Finite automaton) does not fit this question. Option D (Chomsky hierarchy) does not fit this question. For this Theory of Computation (Automata) question, the accepted answer is Pushdown 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
- A sequence of characters that defines a search pattern, corresponding to regular languages. What is this conce...
- The concept in which an abstract computational model that manipulates symbols on an infinite tape according to...
- Non-deterministic finite automaton (NFA) is best defined as which of the following?
- Identify the correct definition of Turing machine.
- Identify the correct concept described as: a finite automaton that may have multiple possible transitions for...
- What term describes the following? a formal grammar in which every production rule has a single non-terminal o...