c. $\{w| w ∈ {0,1}^∗$ $ \text{is not a palindrome}\}^8$
The 8 confuses me a little bit. Can someone clear up what the 8 means?. Is it a typo in the problem?
Show that language is not a regular language by using the pumping lemma or closure
0
$\begingroup$
computer-science
regular-language
finite-automata
-
0The 8 is definitely a typo – 2017-02-18
-
0@Samasambo ok, so I believe I have to use the complement of the language and prove it's not regular right? – 2017-02-18
-
1Correct, regular languages are closed under complementation. – 2017-02-18