Scribd
Upload
1 views

TOC_Endsem

Uploaded by

nafisatamboli72
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

TOC_Endsem

Uploaded by

nafisatamboli72
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

TotalNo.

of Questions :8|
SEAT No. : t90o S8 7
P-7617
|Total No. of Pages:2

|61801-137
T.E. (Anformation Technology)
THEORY OF COMPUTATION
(2019 Patterh) (Semester-I) (314441)
Time : 2% Hours] /Max. Marks : 70
Instructions tothe candidates
) Answer Ql or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
2) Neàt diagrams must be drawn wherever necessary.
3) Figues to the right side indicate full marks.
4) Assumè Suitable data if necessary.

Q1) a) Define context free grammar. Write down CFG for the following regular
expression. |6]
(0+1)0*(1+(01)*)
b) Write a note on Chomsky hierarchy. 16)
c) What is an ambiguous grammar ?Explain with a suitable example. (6]

92) a) What are left linear andright linear regular grammars? Explain the process
of converting a LefLnear Regular Grammar to Right Linear Regular
Grammar with an example. 17]
b) Construct a CNF for the following grammar. 6]
S’aAbB
A’aAla
B->bB|b
c) Check whether the given language is CFL or not L(ab'cn>=0} (5]

03) a) Construct aPDA equivalent to the following GFO: |8]


S ’ OBB E
B ’ 0S | 1S|0
Test if 010° is in language.
b) Compare Finite Automata and Push Down Automata. |4|
c) Write a note on Post machine.
OR
P.T.0.
Q4) a) Find the transition rules of PDA for acceping a language L=
}a,b} *jw is of a'b" with n> through both empty stack and final Stae
and demonstrates the stack operation for the string "aaabbo |9|
b) Design a Post machine for the Janguage L= a"b°c"}. |8|

Q5) a) Design a Turing iachincíosubtract two unary numbers.


b) Explain HalingProblem ofturing machine. |6|
c)) Write a note on Uoiversal turing Machine. |6]
OR
Q6) a) Design aTuring machine to accept language L= (01°2" | n>0}. Draw
transition graph and write down transition table.
b) Explain theconcept of Post Correspondence Problen'with an example |S]
c) Differentiate between Finite Automata and Turing Machine. |4|

Q7) a) Explain in detailDecidable problemsconcerning regular languages, and


Decidable problems concerningentexrree languages. [7]
b) Explain Traveling SalespersorProblem and Justify whether the Traveling
Salesperson Problem is ablass P, orrclassNP problem. |6]
c) What are recursive andTèeursively enumerable languages? (4|
OR
Q8) a) Explain Cook's theorem indetail. (8]
1 1 5 4 8 12
H 96W. 10
2
|70
9 23
b) Explain Satisfiability Problem and comment
C EonG
NPP
Completeness
O | 0 4 4ofthe
1
SAT Problem. 19]

|6180]-137 2

You might also like