2.

56
3. 7.
B. E. (Coll1puter ~cie~ce EngiJ;l~~g) VIth Seinest~r
Examination, Deeember-:-2002
THEORY OF COMPUTATION
Paper-CSE-31O-C
Time allowed: 3 hours Maximum Marks: 100

Note: Attempt any five of the following.

1. Describe the finite state automation by illustrating with

transition diagram. Consider fsm whose transition function 8
is given in the form of a transition table
Q = {'lo, q) , q2' q3}, L = {O, I}, F = {'lo}
Give the entire sequence of states for input string 110001
States Input

~@ 0 1
q2 q)
q) q3 qo
q2 <lo q3
" q3 q\ q2 20

4. Explain Moore machines. How FA can be converted into

Moore machines? 20

3. Explain the algorithm for minimization of FA ? Explain

the closure properties of regular sets. 20

4. Explain the following:

(a) Chomsky Normal Form with examples

567-
400-
P2-
(Q-8)
P.T.
G.
 (2)

(6 yo Construct a regular ··expression corresponding to the

_ ,. ;. i

state diagram .

10,10

s. Explain Push Down Automata and their application in

details. 20

What is Thring Machine? Explain advantages of TM

over FSM.(Finite State Macl'ine).
If L is a regular set over L·, then L - L is also a regular
•over L. 10,10

Expl;rin Chomsky Hierarchies of Grammars.

Design a Turing Machine over {I, b} which can
compute concatenation function oyer L = { 1 }. If a pair
of words (WI' W2) is the input, the output has to be WI
W2• 10,10

8 ... Describe briefly the following: (a)

Context Sensitive Language (b)
Universal Turing Machine (c)
5,8,7
Undeciability.
567-400