https://www.rgpvonline.

com

Total No. of Questions : 8] [1] [Total No. of Printed Pages : 4

Roll No ..................................
CS-501-CBGS
B.Tech., V Semester
Examination, June 2020
Choice Based Grading System (CBGS)
Theory of Computation
Time : Three Hours
Maximum Marks : 70
Note: i) Attempt any five questions.
{H$Ýht nm±M àíZm| H$mo hb H$s{OE&
ii) All questions carry equal marks.
g^r àíZm| Ho$ g_mZ A§H$ h¢&
iii) All parts of each questions to be are attempted at one
place.
à˶oH$ àíZ Ho$ g^r ^mJm| H$mo EH$ hr ñWmZ na hb H$s{OE&
iv) In case of any doubt or dispute the English version
question should be treated as final.
{H$gr ^r àH$ma Ho$ g§Xho AWdm {ddmX H$s pñW{V ‘| A§JO
o« r ^mfm
Ho$ àíZ H$mo A§{V‘ ‘mZm Om¶oJm&

1. a) Differentiate Mealy machine and Moore machine with

diagram. 7
{‘bo ‘erZ Ed§ ‘yao ‘erZ ‘| {MÌ g{hV AÝVa ñnîQ> H$s{OE&
b) Design Turing machine to add two number a and b.
7
a Ed§ b Xmo A§H$mo H$mo OmoS>Zo Ho$ {bE Q>¶y[a¨J ‘erZ {S>μOmBZ H$[a¶o&

CS-501-CBGS PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

[2]

{
2. a) State Pumping Lemma and show that L = a i bi i ≥ 1 is }
not a regular language. 7

npån¨J bo‘m H$mo {b{IE Ed§ àX{e©V H$s{OE {H$ {

L = a i bi i ≥ 1 }
EH$ {Z¶{‘V language Zht h¡&
b) Explain types of Turing machine in detail. 7
Q>¶y[a¨J ‘erZ Ho$ àH$mam| H$s {dñVma go ì¶m»¶m H$s{OE&
3. a) Prove that CFL are not closed under intersection. 7
{gÕ H$[a¶o {H$ CFL B§Q>ago³eZ Ho$ A§VJ©V ³bmoOS> Zht h¡&
b) Construct Moore machine for the following Mealy
machine. 7
Xr JB© {‘bo ‘erZ Ho$ {bE ‘yao ‘erZ H$s aMZm H$s{OE&
1/1 0/2

→ q0 q1 q2
1/2

1/0 0/1
0/0

4. a) Explain P class problems in detail. 7

nr ³bmg g‘ñ¶m H$mo {dñVma go g‘PmBE&
b) What is a trap state in FA? Explain the properties of
transition function. 7
FA ‘|Q´>¡n AdñWm ³¶m h¡? Q´>m§OreZ ’$bZ H$s {deofVmAm| H$mo
g‘PmBE&
5. a) Define DFA, List three household applications of finite
automata. 7
DFA H$mo n[a^m{fV H$s{OE, ’$mBZmBQ> Am°Q>mo‘oQ>m Ho$ VrZ Kaoby
AZwà¶moJ {b{IE&

CS-501-CBGS Contd...
PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

[3]

b) What are leftmost and rightmost derivations? Explain with

suitable example. 7
A{Vdm‘ Ed§ Xm{hZo ì¶wËn{Îm ³¶m h¡? EH$ CXmhaU g{hV g‘PmBE&

6. a) What is PDA? Explain instantaneous description of PDA.

7
PDA ³¶m h¡? PDA Ho$ VmËH$m{bH$ {ddaU H$m CëboI H$s{OE&
b) Show that the following grammar is ambiguous. 7
àX{e©V H$s{OE {H$ Xr JB© J«m‘a Añnï> h¡&
S → aSbS bSaS ∈

7. a) How can we construct regular grammar from regular

expression? 7
h‘ {Z¶{‘V E³gàoeZ go {Z¶{‘V J«m‘a H$s aMZm H¡$go H$a gH$Vo
h¡?
b) Write given CFG for R.E (011 + 1)*(01)*. 7
{X¶o JE R.E (011 + 1)*(01)* Ho$ {bE CFG {b{IE&

8. Write short note on any three of the following. 14

i) Undecidable problem
ii) Two way finite automata
iii) UTM
iv) Multitape
v) Recursively enumerable set

CS-501-CBGS PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

[4]

{ZåZ{b{IV ‘§o go {H$Ýht VrZ na g§{jßV {Q>ßnUr {b{IE&

i) A{ZU©¶r g‘ñ¶m
ii) {Û-nWr ’$mBZmBQ> Am°Q>m‘
o Qo >m
iii) ¶y Q>r E‘
iv) ‘ëQ>rQ>no
v) nwZamd¥{Îm Bݶw‘ao~b goQ>

******

CS-501-CBGS PTO

https://www.rgpvonline.com