Prove using pumping lemma that the following language is not a regular language. L = {palindromes with length a multiple of 4}
Added by John S.
Close
Step 1
Assume that L is a regular language. Show more…
Show all steps
Your feedback will help us improve your experience
Gokul R Nair and 50 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Show that the set of palindromes over $\{0,1\}$ is not regular using the pumping lemma given in Exercise 22 . [Hint: Consider strings of the form $0^{N} 10^{N} . ]$
Modeling Computation
Language Recognition
Use the Pumping Lemma (with the adversary argument) to prove that the language {ww|w ∈ (0+1+2)*} is not regular.
Madhur L.
Let L = { a^n b^i a^k | k > n + i } a. List all strings of length 7. (use power notation: i.e. aabbbbaaaaaaaa is a^2b^4a^8) b. Use the Pumping Lemma for Regular Languages to prove that L is not regular.
Vaidik S.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD