CS381-2006fa-prelim2 - CS 381 Fall 2006 Second Mid Term...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 381 Second Mid Term Monday, Nov. 13, 2006 Fall 2006 Upson B17 This is a 50-minute in class closed book exam. All questions are straightforward and you should have no trouble doing them. Please show all work and write legibly. Grading will take into account the clarity of your answer. 1. Let () * La b c ⊆+ + consist of all strings with an equal number of a’s, b’s, and c’s. Prove that L is not a context-free language. 2. Prove that the class of context-free languages is closed under inverse homomorphisms 3. Let 0 ,,,, ,, M Qq b F δ Γ be a Turing machine. Write a
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This homework help was uploaded on 01/29/2008 for the course CS 3810 taught by Professor Hopcroft during the Fall '07 term at Cornell University (Engineering School).

Ask a homework question - tutors are online