0 ratings0% found this document useful (0 votes) 23 views3 pagesTheory of Computation Nov2019
This is rgpv questions paper
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
eS
Total No. of Questions : 8]
[Total No. of Printed Pages : 3
Roll No......
CS-501 (CBGS)
B.Tech. V Semester
Examination, November 2019
Choice Based Grading System (CBGS)
Theory of Computation
Time : Three Hours
Maximum Marks : 70
Note: i) Attemptany five questions.
il.
CS-501 (CBGS)
a)
b)
feordt ora eat at get AfBry
ii) All questions carry equal marks.
wh aeat & aa sie ZI
iii)In case of any doubt or dispute the English version
question should be treated as final.
feel fl veo & ee sera fare Ht fata A sith ara
& We @) sifer AAT RATT
What do you mean by closure properties of regular
languages? Define some important Closer properties.
Regular languages (151) & Closure properties (quit) &
aan attra &? Hw ETI! Closer properties (quit)
afta &1
Obtain the regular expression for the following set :
i) Set ofall strings over D=(a,b) with exactly two a,
ii) L=(a*| xis divisible by 3 or 5}
PreiferRacr set & fa Bitte regular expression ct @aReqt
Rl
i) wh strings PT FYE L=(a,b) Fel baer two (et) ad.
ii) L=(a" |e xa at 3 arert 5 3 fea a wd}
PTO (2]
2. Prove the following two properties :
Priifert 2} fadtectal at aeanfia we:
a) Regular set are closed over the intersection operation,
Regular Set Intersection Hi IK closed a #1
Let A and B are context free language over the same
alphabet © then, prove that AUB (A union B) is also
context free.
FIAT St A sik Bl aNMT, ¥ alphabet & SAX context free@
ATA 2, ct ween we Ht AUB (Aunion B) context
free #11
b)
3. a) Find the CNF (Chomsky
CFG:
S-->ABA
A->aAle
B-->bBle
Preafettrd CFG & fie CNF (Chomsky Normal Form)
Is wR,
S§-->ABA
A->adle 3
B--> bBle
Convert the following grammar to GNF :
A, ->A,A,
A,->A,A\|b
A,-->A, Ala
frraferfad grammar (a7) to GNF 4 oRafala a -
A, ->A,A;
A> AAD
A,->A, Aa ‘
5-501 (CBGS) ; Contd...
Normal Form) for the following
b) B)
. Explain the Mealy and Moore Machines in brief. Also describe
what are the differences between them.
Mealy vd Moore setts &ht ata # carer a1 Grr ¥ sags nee
sie) wt oft rea
. Designa PDA that accepts the language L={a" b™ a": m,n >0}
Wh PDA (ge sted aiiePer) ar Prato ax, at Peafereaa ara
(Language) #1 Wage @) L={a"b™ a": m,n>0}
. What do you understand by recursive enumerable languages?
Explain the Turing machine with its properties.
Recursive enumerable languages (191) & ST FA WAsra B?
Turing machine (agi) &t Seep Woes & Sree oe CaM aX
- Describe the NFA and DFA in brief. Also, explain the
construction of DFA for the following regular expression :
r = (0+1)*(00+11) (0+1)*
NFA (4 DFA & dag 4 our & cen Preifea regular
expression & fig DEA tam Sit TOReaT OY SA Tesfa ay
r = (0+1)*(00+11) (O+1)*
. Write short notes on any three :
Prrcifesact 3 & feat cts 8 Grae wake A RaeoT 2
i) Reducibility
ii) Epsilon transition
iii) Halting problem of Turin 1g machine
iv) NP complete problems
ess
CS-501 (CBGS)
