Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
15Activity
0 of .
Results for:
No results containing your search query
P. 1
Nr 310504 Theory of Computation

Nr 310504 Theory of Computation

Ratings:

4.5

(2)
|Views: 1,462|Likes:
Published by Srinivasa Rao G

More info:

Published by: Srinivasa Rao G on Jan 29, 2008
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less

11/25/2010

pdf

text

original

 
Code No.310504III B.Tech. I-Semester Regular Examinations, November-2003THEORY OF COMPUTATION(Common to Computer Science and Engineering, Computer Science and SystemsEngineering and Computer Science and Information Technology)Time: 3 hoursMax.Marks:80Answer any FIVE questionsAll questions carry equal marks---
1.Define NFA mathematically. Explain its significance and function. Convert thegiven Finite automaton into its Determinstic. Explain the method used. Takingsuitable example prove both accept the same strings. 2.a)Define NFA-E transitions and write the differences between NFA-E and ordinary NFA.b)Find NFA without E for the followingc)Construct state transition table for the following Moore machine.
(Contd…2)
 
Set No.
1
 
Code No.310504-2-Set No.1
3.a)Give the recursive definition for regular expression and prove every regular expression can be represented by an NFA with epsilon transitions.b)Construct the regular expression accepted by following finite automaton.4.a)Construct regular grammar G generating the regular set a
*
b(a+b)
*
.b)Define CFG and give examples. What is CFL generated by the gramma
 E  AbbAa BaaBb AabB
,,,
5.a)Design a PDA which accepts all strings there can be derived from the followingGrammar. Taking a suitable example verify the machine.S aB/bAA a/aS/bAAB b/bS/aBBb)Prove that acceptance by empty stack and by final state is equivalent.6.a)What is delta of a Turing Machine, explain functions involved in a move of Turing Machines in detail.b)Design Turing Machine to accept even palindromes derived from the input {a,b}.Give its Transition table and diagram also.7.a)Discuss the Chomsky hierarchy of languages,.b)For the grammar shown below constant the sets of LR(0) items.S
'
→ S $S
 
→ aSb|ab8.a)What is decidability? Explain any two undecidable problems.b)Show that the following post correspondence problem has a solution and give thesolution.List AList BiW
i
X
i
1111112100001311111*** *** ***
 
Code No.310504III B.Tech. I-Semester Regular Examinations, November-2003THEORY OF COMPUTATION(Common to Computer Science and Engineering, Computer Science and SystemsEngineering and Computer Science and Information Technology)Time: 3 hoursMax.Marks:80Answer any FIVE questionsAll questions carry equal marks---
1.Define NFA mathematically. Explain its significance and function. Convert thegiven Finite automaton into its Determinstic. Explain the method used. Takingsuitable example prove both accept the same string.2.a)Define epsilon closure – Find epsilon closures fo all the states of given NFA-E.Remove epsilons with out changing the acceptance.b)Construct Moore machine equivalent to the mealy machine described below.q
i
a=0a=1q
i+1
outputq
i+1
Outputq
1
q
1
1q
2
0q
2
q
4
1q
4
1q
3
q
2
1q
3
1q
4
q
3
0q
1
1
(Contd…2)
Set No.
2

Activity (15)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
ssasenthils liked this
ksai.mb liked this
ksai.mb liked this
tkprgrg liked this
haldimir liked this
shukla8000 liked this
Kusum Singh liked this
Suyash Deosthali liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->