Due Dates:  Oral presentations of material begin on 1 November.
Written descriptions of material presented due one week after presentation.

Topics: Non-context-free Languages (Chapter 2).

An integral part of this class is understanding and presenting the problems assigned as homework. Everyone is expected to do all the problems, but we will take turns on who presents the problem solutions to the class (every 2-3 weeks, depending on the number of students in the class). Within a week of presenting a problem solution to the class, you must submit a written description of it, via the Blackboard system. The written solutions will be posted on the Blackboard website for the class, so, they can used by everyone to study for the exams. Since it's hard to write down answers that are concise and are easily readable by all, if you wish to improve a grade on any problem, you may resubmit it for grading.

All students enrolled should complete the following:

1. Use the pumping lemma to show that the following language is not context-free:
{0n10n1n | n ≥ 0}
2. Use the pumping lemma to show that the following language is not context-free:
{0n102n103n | n ≥ 0}
3. Use the pumping lemma to show that the following language is not context-free:
{w#x | w is a substring of x}
where the language is Σ = {a,b}.

4. Show that the following language is not context-free:
{w#x | x is a substring of w}
where the language is Σ = {a,b}.

Hint: You may use the result of the previous question.

Students enrolled for graduate credit, should complete all the undergraduate problems, as well as:

1. Let C be a context-free language and R a regular language. Prove that C ∩ R is context free.
2. Show that the following language is not context-free:
A = {w | w contains equal numbers of a's, b's and c's}
is not a context free language.

Hint: You may use the result of the previous question.