This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Nothing written on the back of this page will be marked 1 CSE2001 – Introduction to the Theory of Computation, Fall 2006 Test 2 Monday, November 13, 2006 Duration – 75 minutes No aids allowed Counting the cover there are 9 pages. There are 2 blank pages at the end. First name: Last name: Student ID: Question 1 /15 Question 2 /10 Question 3 /20 Question 4 /40 Question 5 /10 Total /95 Nothing written on the back of this page will be marked 2 Question 1 (15 points) For each the following statements indicate whether it is TRUE or FALSE (1 point) , and justify your answer (2 points) . (a) For any nonregular language L , there is a PDA P , such that L = L ( P ). Circle one: TRUE FALSE Justify your answer: (b) For any context-free language L 1 and any regular language L 2 , the language L 1 ∪ L 2 is nonregular. Circle one: TRUE FALSE Justify your answer: (c) For any context-free language L 1 , there is a regular language L 2 , such that L 2 ⊂ L 1 ....
View Full Document
- Winter '10
- Formal language, Formal languages, Regular expression, Regular language, context-free, REG NON-REG-CF NON-CF