Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Rr310504 Theory of Computation

# Rr310504 Theory of Computation

Ratings: (0)|Views: 333|Likes:

### Availability:

See more
See less

02/01/2013

pdf

text

original

Code No: RR310504
Set No. 1
III B.Tech I Semester Supplimentary Examinations, February 2008
THEORY OF COMPUTATION
( Common to Computer Science & Engineering and Computer Science &
Systems Engineering)
Time: 3 hours
Max Marks: 80
All Questions carry equal marks
\u22c6 \u22c6 \u22c6 \u22c6 \u22c6

1. For the following state transition table draw the state transition diagram. Find its equivalent machine. For the string abbaaab test whether both give same result or not.q0 is the initial state andq3 is the \ufb01nal state.

[16]
q / \u03a3
0
1
q0
q1
q2
q1
q1
q1 q3
q2
\u03c6
\u03c6
q3
q0 q3
q3
2. (a) Compare three Finite automata critically.
(b) Construct DFA equivalent to the following Finite automation. Figure 2
[8+8]
Figure 2

3. (a) Construct a regular expression representing the following sets The set of all strings over{a, b} in which there are atleast two occurrences of b between any two occurrences of a.

(b) Describe whether L ={a2n|n \u2265 1} is regular. State and explain the theorem
used.
[8+8]
4. (a) Obtain the regular grammar to accept the strings containing even number of
zeroes.
(b) Give the CFG to generating the following sets
The set of palindromes over alphabet{a, b}
[8+8]
5. Construct a context free grammar which accepts N(A) where A is
({q0,q1,q2},{a, b, c},{a, b,z0},\u03b4 ,q0,z0,q2)
where\u03b4 is given by
\u03b4(q0, a, z0) = (q0, az0)
\u03b4(q0, b, z0) = (q0, bz0)
1 of 2
Code No: RR310504
Set No. 1

\u03b4(q0, a, a) = (q0, aa)
\u03b4(q0, b, a) = (q0, ba)
\u03b4(q0, a, b) = (q0, ab)
\u03b4(q0, b, b) = (q0, bb)
\u03b4(q0, c, z0) = (q1, z0)
\u03b4(q0, c, a) = (q1, a)
\u03b4(q0, c, b) = (q1, b)
\u03b4(q1, a, a) = (q1,\u2208)
\u03b4(q1, b, b) = (q1,\u2208)

\u03b4(q1,\u2208 , z0) = ( q2, z0)
[16]
6. (a) Give formal de\ufb01nition of Turing Machine and explain the concept behind
saying \u201cTuring Machine is more powerful than the digital computer\u201d.
(b) Design Turing Machines for the following:
i. To compliment a given binary number.
ii. To compute f(x,y) = x+y for x and y positive integers represented in
Unary.
[4+12]
7. (a) Discuss di\ufb00erent languages and their corresponding machines.
(b) Write the design procedure of shift reduce parser by taking a suitable example.
[8+8]
8. Write short notes on any three of the following.
(a) NP hard problems

(b) Reducability
(c) PCP
(d) UTM.

[16]
\u22c6 \u22c6 \u22c6 \u22c6 \u22c6
2 of 2
Code No: RR310504
Set No. 2
III B.Tech I Semester Supplimentary Examinations, February 2008
THEORY OF COMPUTATION
( Common to Computer Science & Engineering and Computer Science &
Systems Engineering)
Time: 3 hours
Max Marks: 80
All Questions carry equal marks
\u22c6 \u22c6 \u22c6 \u22c6 \u22c6

1. (a) Di\ufb00erentiate NFA and DFA with respected to transition and acceptance.
(b) Draw DFA which accepts even number of a\u2018s over the alphabet{a, b}
(c) Construct DFA equivalent to the following Finite state machine. Figure 1

[2+6+8]
Figure 1
2. (a) Explain the procedure to convert NFA-\u2208 to ordinary NFA, and apply the
same for the following \ufb01gure 2a.
Figure 2a
(b) Design Moore and Mealy machines which converts a ternary number into
Residue Modulo 5.
[8+8]
3. (a) Construct Finite automaton to accept the regular expression (0 + 1)\u2217 (00+11)
(0 + 1)\u2217.
(b) Find the regular expression accepted by following deterministic Finite automa-
ton. Figure 3
[8+8]
1 of 3

## Activity (8)

Faisal AlOsaimi liked this
Vasanthi Vasoo liked this
asong_soekamti liked this
rajaramansuresh liked this
raja22goyal liked this
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->