test01 - Nothing written on the back of this page will be...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Nothing written on the back of this page will be marked 1 CSE2001 – Introduction to the Theory of Computation, Fall 2006 Test 1 Monday, October 16, 2006 Duration – 75 minutes No aids allowed Counting the cover there are 11 pages. There are 2 blank pages at the end. First name: Last name: Student ID: Question 1 /15 Question 2 /20 Question 3 /15 Question 4 /20 Question 5 /10 Question 6 /20 Question 7 (bonus) /10 Total /100
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
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) Every ±nite language is regular. Circle one: TRUE FALSE Justify your answer: (b) Every regular language has a proper subset which is also regular. Circle one: TRUE FALSE Justify your answer: (c) If M is an NFA, then there exists a regular expression that describes L ( M ). Circle one:
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/11/2010 for the course CSE CSE 2001 taught by Professor N during the Winter '10 term at York University.

Page1 / 11

test01 - Nothing written on the back of this page will be...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online