← All topics
Quiz: Pumping Lemma and Minimisation: questions with answers
10 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. In a pumping-lemma proof that L is not regular, what do YOU get to choose?
- Q2. Why is {a^n b^n} not regular?
- Q3. What can the pumping lemma for regular languages prove?
- Q4. In the minimisation demo, how many states did the minimal DFA have?
- Q5. What is the first split in partition-refinement minimisation?
- Q6. In the pumping lemma, why must the loop y satisfy |xy| ≤ p?
- Q7. To prove palindromes over {a, b} are not regular, which string is a good choice?
- Q8. Two strings x and y are distinguishable for L when:
- Q9. What does this print? (code)
- Q10. What is the first step of DFA minimisation, before splitting into groups?