Lehman College, City University of New York

Fall 2016

Grading Notes:

- Submit one answer per group.
- Make sure that the answer is legible.
- Include the full names of all group members on your submitted work (so all get credit).

Recall that a

- Show that the language of all palindromes over {0,1} is not a regular language.
- Show that the language of all palindromes over {0,1} is a context-free language.
- Show that the language of all palindromes over {0,1} containing an equal number of 0's and 1's is
**not**a context-free language.