2007學(xué)年秋冬季學(xué)期

2006-2007《計(jì)算理論》課程期末考試開(kāi)課學(xué)院：計(jì)算機(jī)學(xué)院考試形式：閉卷，允許帶 考試時(shí)間:2007年1月24日，所需時(shí)間:120分鐘，任課教師:考生 學(xué)號(hào) 專業(yè)題12345678總得ZhejiangTheoryofComputation,Fall-Winter2006FinalExam(30%)Determinewhetherthefollowingstatementsaretrueorfalse.IfitistruewriteaXotherwisea×inthebracketbeforethestatement. )IfaDFAMcontainsaself-looponsomestateq,thenMmustacceptaninfinitelanguage. )LetAandBbetworegularlanguages,soisA⊕B,whereA⊕B=(A?B)∪(B?A). ∪i=1 )Language{ucv|u,v∈{a,b}and|u|=2|v|}iscontext )SupposethatLisacontext-freelanguageandRisregular,L?Rcontext-free )Everycomputablefunctionisprimitive )Thecomplementofeveryrecursiveenumerablelanguageisrecursiveenu- )LetLbealanguageandthereisaTuringmachineMhaltsonxforx∈L,thenLis )Ifonecanlisttheelementsofalanguageinorder,thenthelanguagemustberecursive. )Languages{“M”:TuringmachineMacceptsatleast2007distinctinputs}isrecursiveenumerable.(12%)Decidewhetherthefollowinglanguagesareregularornotandprovideaformalproofforyouranswer.L1={aku|u∈{a,banducontainsatleastka’s,fork≥L2={aku|u∈{a,banducontainsatmostka’s,fork≥DescribethelanguageacceptedbythefollowingfiniteGiveaContext-freeGrammarforthe(14%)ConsiderthepushdownautomatonM={K,Σ,Γ,?,s,F}whereK{s,f},Σ={a,b},Γ=,F={f}and?isgivenbythefollowing((p,a,β),(q,((s,a,e),(f,((s,b,e),(s,((s,a,b),(s,((s,e,e),(f,((f,a,e),(f,((f,b,e),(s,CanPDAMacceptstringDescribethelanguageacceptedbyMGiveaTuringmachinethatdecidesthesame(12%)Showthefollowing?f(x)

x+1, ifxisodd ifxisisprimitive(10%)ExplainthatwhythefollowingH={“M”:TuringmachineMhaltsonemptystringisrecursivelyenumerable.Aninformaldescription(10%)LetK0={“M”“w”:Mhaltsoninputstringw},K1={“M”:Mhaltsoninputstring“M”}.TrytosignlanguagesK0,K1andsetsoflanguagesrecursive,context-freelanguageandregulartothecorrespondingzoneofthefollowingfigure