Let ANTIPALINDROME be the language of all even-length strings over the alphabet ...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Let ANTIPALINDROME be the language of all even-length strings over the alphabet {a,b} such that, for all i, the i-th letter from the start is different to the i-th letter from the end. Examples of strings in this language include:
ε, ab, ba, aabb, abab, baba, bbaa, aaabbb, ...
Using the Pumping Lemma for Regular Languages, prove that ANTIPALINDROME is not regular.
Want instant access to all verified answers on learning.monash.edu?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!