CT-G-04sol - Graduate Course THEORY OF COMPUTATION College...

Info iconThis preview shows pages 1–2. 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: Graduate Course THEORY OF COMPUTATION College of Computer Science Final Exam Zhejiang University Solution Fall 2004 Class ğ ID ğ Name ğ Score: Time allowed: 2 Hours. 1. (20%) 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) ( X ) Every context-free language is recursive. (b) ( X ) Language { a m b n c l | m,n,l ∈ N ,m + n > 3 l } is context free. (c) ( X ) Every language in NP is recursive. (d) ( × ) All languages on an alphabet are recursively enumerable. (e) ( × ) There’s a language L such that L is undecidable, yet L and its complement are both semi-decided by the some Turing machine. (f) ( × ) There’s a function ϕ such that ϕ can be computed by some Turing ma- chines, yet ϕ is not a primitive recursive function. (g) ( × ) Let L 1 ,L 2 ⊆ Σ * be languages, recursive function τ is a reduction from L 1 to L 2 , if L 1 is decidable, then so is L 2 . (h) ( × ) A language L is recursive if and only if it is Turing-enumerable....
View Full Document

Page1 / 3

CT-G-04sol - Graduate Course THEORY OF COMPUTATION College...

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