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) MCQ checks one syllabus fact.
The question is: “The sequence of production rule applications used to generate a string from a grammar's start symbol. What is this concept called?”
The accepted answer is B. Derivation. “The sequence of production rule applications used to generate a string from a grammar's start symbol. What is this concept called” is answered by Derivation (option B). Option A (“DFA minimization”) does not match the stem; it is a near-miss used to catch incomplete recall of Derivation. Option C (“String (formal language)”) does not match the stem; it is a near-miss used to catch incomplete recall of Derivation. Remaining alternatives (Epsilon transition) fall outside the same rule and should be eliminated once Derivation is identified. Theory of Computation (Automata) questions of this type reward precise definitions rather than approximate associations. Theory of Computation (Automata) recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.
- A. DFA minimization
Why not A: “DFA minimization” is not correct. The accepted answer is B. Derivation. “The sequence of production rule applications used to generate a string from a grammar's start symbol. What is this concept called” is answered by Derivation (option B). Option A (
- B. Derivation ✓
- C. String (formal language)
Why not C: “String (formal language)” is not correct. The accepted answer is B. Derivation. “The sequence of production rule applications used to generate a string from a grammar's start symbol. What is this concept called” is answered by Derivation (option B). Option A (
- D. Epsilon transition
Why not D: “Epsilon transition” is not correct. The accepted answer is B. Derivation. “The sequence of production rule applications used to generate a string from a grammar's start symbol. What is this concept called” is answered by Derivation (option B). Option A (
Correct answer
B. Derivation
Explanation
“The sequence of production rule applications used to generate a string from a grammar's start symbol. What is this concept called” is answered by Derivation (option B). Option A (“DFA minimization”) does not match the stem; it is a near-miss used to catch incomplete recall of Derivation. Option C (“String (formal language)”) does not match the stem; it is a near-miss used to catch incomplete recall of Derivation. Remaining alternatives (Epsilon transition) fall outside the same rule and should be eliminated once Derivation is identified. Theory of Computation (Automata) questions of this type reward precise definitions rather than approximate associations. Theory of Computation (Automata) recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.
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...