CT-U-05 - 2005-2006 120 1 2 3 4 5 6 7 Zhejiang University...

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

View Full Document Right Arrow Icon
ᆄࡾն࿐ 2005-2006 ࿐୍ ౬׫ ࿐௹௹ଌॉ൫ u࠹ෘ৘ંvज़ӱ൫ज ॉ൫ൈࡗğ 120 ٳᇒ षज़࿐ჽğ ࠹ෘࠏ࿐ჽ ህြğ ಩ज़࢝ഽğ ྠ଀ğ ࿐ݼğ ี྽ 1 2 3 4 5 6 7 ሹٳ ֤ٳ ௟ᄇದ Zhejiang University Theory of Computation, Fall-Winter 2005 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) ( ) Language { a m ( bc ) n : m,n N } is not regular. (b) ( ) Language { a i b j c k | i,j,k 0 ,i j + k } is context-free. (c) ( ) Let F = { f : f be a primitive recursive function from N to N } , then 2 F (Power set of F ) is uncountable. (d) ( ) Let L 1 ,L 2 , ··· ,L i , ··· be all regular languages, so is i =1 L i . (e) ( ) Suppose language L is context-free and L 0 is a regular, then L * L 0* is context-free. (f) ( ) Every computable function is primitive recursive. (g) (
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.

Page1 / 4

CT-U-05 - 2005-2006 120 1 2 3 4 5 6 7 Zhejiang University...

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