CSC236H: Introduction to the Theory of Computation Bonus Homework Due on Tuesday April 6, 2010 (in review session, see announcements) Note that this assignment is for extra credit. If you do not want the extra credit, you do not have to hand in this assignment. As mentioned in class, the grading rules are more strict for this assignment. There is no partial credit for any problem; you either get it right and get the full mark, or you get zero. For problems that have several parts, this rule applies to each part, and not the whole problem. 1. If L 1 and L 2 are context-free language, then prove that (a) L 1 ∪ L 2 is a context-free language. (b) L 1 L 2 is a context-free language. (c) L * 1 is a context-free language. Hint: There are very short arguments for each of the three parts of this problem. 2. Show by giving an example that, if M is an NFA that recognizes language C , swapping the accept and non-accept state in M does not necessarily yield a new NFA that recognizes the complement of C . Does this mean

This is the end of the preview. Sign up
to
access the rest of the document.