oldexam - Page 1 out of 8 YORK UNIVERSITY FACULTY OF PURE...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Page 1 out of 8 YORK UNIVERSITY FACULTY OF PURE AND APPLIED SCIENCE 2005 WINTER TERM EXAMINATION Course Number: COSC2001 Title: Introduction to Theory of Computation Duration: 3 hours No aids allowed. There should be 8 pages in the exam, including this page. Write all answers on the examination paper. If your answer does not fit in the space provided, you can continue your answer on the back of a page, indicating clearly that you have done so. You may use Churchs Thesis in your answer to any question on this exam. Write legibly. Name (Please underline your family name.) Student Number 1. /12 2. /6 3. /3 4. /3 5. /4 6. /3 7. /3 8. /3 9. /2 10. /4 11. /4 12. /3 Total: /50 contd. . . Page 2 out of 8 1. [12 marks] For each of the following, you must determine whether the statement is true or false. Circle the correct answer. Then briefly justify your answer. (a) [2] Every subset of a regular language is regular. TRUE FALSE (b) [2] If language L is regular then { xy : x L and y R L } must also be regular. (Recall that y R is the string y written backwards.) TRUE FALSE (c) [2] If there is a pushdown automaton with only one state that accepts the language...
View Full Document

Page1 / 8

oldexam - Page 1 out of 8 YORK UNIVERSITY FACULTY OF PURE...

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