Theory of Computation (Automata)
In computer science, Pumping lemma refers to which of the following?
- A. The sequence of production rule applications used to generate a string from a grammar's start symbol.
- B. A property used to prove that certain languages are not regular by showing they cannot be 'pumped' while remaining in the language. ✓
- C. A finite sequence of symbols drawn from an alphabet.
- D. A class of formal languages recognized by a linear-bounded automaton, more powerful than context-free languages.
Correct answer
B. A property used to prove that certain languages are not regular by showing they cannot be 'pumped' while remaining in the language.
Explanation
Pumping lemma refers to a property used to prove that certain languages are not regular by showing they cannot be 'pumped' while remaining in the language.