CT-G-06 - 2006-2007 : 2007 1 22:120 : 1 2 3 4 5 6 7 8...

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

View Full Document Right Arrow Icon
ᆄࡾն࿐ 2006-2007 ࿐୍ ౬׫ ࠱࿐௹ ࿹࣮ളu࠹ෘ৘ંvज़ӱ௹ଌॉ൫൫ज ॉ൫ൈࡗ : 2007 1 22 ರđ෮ླൈࡗ :120 ٳᇒđ಩ज़࢝ഽ : ॉളྠ଀ğ ࿐ݼğ ህြğ ี྽ 1 2 3 4 5 6 7 8 ሹٳ ֤ٳ ௟जದ Zhejiang University Theory of Computation, Fall-Winter 2006 Final Exam 1. (30%) Determine whether the following statements are true or false. If it is true write a X otherwise a × in the bracket before the statement. (a) ( ) A countable union of regular languages is necessarily regular. (b) ( ) If a DFA M contains a self-loop on some state q , then M must accept an infinite language. (c) ( ) Language { ucv | u,v ∈ { a,b } * and | v | < | u | < 2 | v |} is context-free. (d) ( ) For a given context-free language L and a string x , the decision problem for whether x L is decidable. (e) ( ) The complement of every recursive enumerable language is necessarily nonrecursive enumerable. (f) (
Background image of page 1

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

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

This note was uploaded on 01/23/2012 for the course CS 220 taught by Professor Xiaogangjin during the Spring '09 term at Zhejiang University.

Page1 / 4

CT-G-06 - 2006-2007 : 2007 1 22:120 : 1 2 3 4 5 6 7 8...

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

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