Theory of Computation (Automata)
The sequence of production rule applications used to generate a string from a grammar's start symbol. What is this concept called?
Difficulty: Hard
About this MCQ
This Hard Theory of Computation (Automata) question asks: The sequence of production rule applications used to generate a string from a grammar's start symbol. What is this concept called? The correct choice is B. Derivation. 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. DFA minimization
Why not A: “DFA minimization” does not fit this question. The answer is Derivation.
- B. Derivation ✓
- C. String (formal language)
Why not C: “String (formal language)” does not fit this question. The answer is Derivation.
- D. Epsilon transition
Why not D: “Epsilon transition” does not fit this question. The answer is Derivation.
Correct answer
B. Derivation
Explanation
Derivation (option B) is the accepted answer to “The sequence of production rule applications used to generate a string from a grammar's start symbol. What is this concept called”. Option A (DFA minimization) does not fit this question. Option C (String (formal language)) does not fit this question. Option D (Epsilon transition) does not fit this question. For this Theory of Computation (Automata) question, the accepted answer is Derivation.
Source: Theory of Computation (Automata) Official Reference Guide
Tags: computer science, automata theory, theory of computation, formal languages
Submitted by: MCQsHub Editorial
Related MCQs
- Identify the correct concept described as: the process of reducing a deterministic finite automaton to the sma...
- Which of the following best names the concept in which a grammar for which some string can be generated by mor...
- Which of the following best describes DFA-NFA equivalence?
- What is the function or purpose of Ambiguous grammar?
- What is the name for the concept where a DFA and an NFA are considered equivalent because they recognize exact...
- The concept in which a Turing machine capable of simulating any other Turing machine given its description and...