What term describes the following? a property used to prove that certain languages are not regular by showing they cannot be 'pumped' while remaining in the language.

Question

Accepted Answer

D. Pumping lemma — 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.

Answer

A. Kleene star

Answer

B. Context-sensitive language

Answer

C. Formal language

Answer

D. Pumping lemma

What term describes the following? a property used to prove that certain languages are not regular by showing they cannot be 'pumped' while remaining in the language.

Correct answer

Explanation