Theory of Computation (Automata)
The following statement describes a specific concept. What is it called? a classification of formal grammars into four types based on their generative power.
Difficulty: Hard
About this MCQ
This Hard Theory of Computation (Automata) question asks: The following statement describes a specific concept. What is it called? a classification of formal grammars into four types based on their generative power. The correct choice is D. Chomsky hierarchy. 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. Context-free grammar
Why not A: “Context-free grammar” does not fit this question. The answer is Chomsky hierarchy.
- B. Turing machine
Why not B: “Turing machine” does not fit this question. The answer is Chomsky hierarchy.
- C. Alphabet
Why not C: “Alphabet” does not fit this question. The answer is Chomsky hierarchy.
- D. Chomsky hierarchy ✓
Correct answer
D. Chomsky hierarchy
Explanation
Chomsky hierarchy (option D) is the accepted answer to “The following statement describes a specific concept. What is it called? a classification of formal grammars into four types based on their generative power.”. Option A (Context-free grammar) does not fit this question. Option B (Turing machine) does not fit this question. Option C (Alphabet) does not fit this question. For this Theory of Computation (Automata) question, the accepted answer is Chomsky hierarchy.
Source: Theory of Computation (Automata) Official Reference Guide
Tags: computer science, automata theory, theory of computation, formal languages
Submitted by: MCQsHub Editorial
Related MCQs
- Which concept is defined as follows: the undecidable problem of determining whether a given program will finis...
- Which term refers to a property of a problem indicating whether an algorithm can be constructed that always pr...
- Which statement correctly explains Regular language?
- What does Decidability refer to?
- Select the correct name for: a language that can be expressed using a regular expression or recognized by a fi...
- What is the name for a finite, non-empty set of symbols used to construct strings in a formal language?