Question
Prove that the set of nonpalindromes over $\{a, b\}$ is not a regular language.
Step 1
A nonpalindrome over the set $\{a, b\}$ is any string that does not read the same forwards and backwards. For example, the string "ab" is a nonpalindrome because "ab" does not equal "ba", its reverse. Show more…
Show all steps
Your feedback will help us improve your experience
Adriano Chikande and 57 other 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
Prove that for all sets $A$ and $B, A \subseteq B$ if and only if $\bar{B} \subseteq \bar{A}$.
Proofs
More Methods of Proof
Transcript
100,000+
Students learning Computer Science with Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD
