I got this question which asks me to figure out `"Why is it foolish to write a regular expression for the language that consists of strings of 0's and 1's that are palindromes?"` (they read the same backwards and forwards). 

Part 2 of the question says that `"using any formal mechanism of your choice, show how it is possible to express the language that consists of strings of 0's and 1's that are palindromes."`