Scribd
Upload
32 views

Model2 - Iiicse - CS8501 - Toc - Set2

Uploaded by

A V S COLLEGE OF TECHNOLOGY SALEM
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
32 views

Model2 - Iiicse - CS8501 - Toc - Set2

Uploaded by

A V S COLLEGE OF TECHNOLOGY SALEM
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

A V S COLLEGE OF TECHNOLOGY, Salem-636106

B.E MODEL EXAM-II


Fifth Semester
Regulation-2017
Dept: Computer Science and Engineering Date:
Subject Code & Name: CS8501 & Theory of Computation Duration: 3 Hours
Part-A
Answer all the questions: 10X2=20
1 . What is closure of a state q0?.
2. Identify NFA- ε to represent a*b | c (Nov-11)
3. Illustrate a regular expression for the set of all the strings have odd number of 1’s
R.E=1(0+11)*.
4. Construct RE for the language over the set z={a,b} in which total number of a’s are
divisible by 3.
5. Differentiates the condition of CNF and GNF.
6. . Examine the context free Grammar representing the set of Palindrome over
(0+1)*(May-13)
7. Define Turing Machine.
8. Prepare the difference between finite automata and turing machine
9. Define a universal language Lu?(Apr-17)
10. Formulate the two properties of recursively enumerable sets which
are undecidable
Part-B
Answer all the questions. 5X13=65
11. a i Explainif L is accepted by an NFA with ε-transition then show that L is
accepted by an NFA without ε-transition.(6)
ii.Construct a DFA equivalent to the NFA. M=({p,q,r},{0,1},δ,p,{q,s}) Where δ is
defined in the following table.(7)

0 1
p {q,s} {q}
q {r} {q,r}
r {s} {p}
s - {p}
(Or)
b. Construct DFA equivalent to the NFA given below:

12. a . Examine whether the language L=(0n1n| n>=1) is regular or not? Justify your
answer (13) (or)
b .i Prove the L1 and L2 are two languages then L1 U L2 is regular (7)
ii. Prove the L1 and L2 are two languages then L1 intersection L2 is
regular (6) (Nov-13)

13.a. i. Examinethe role of checking off symbols in a Turing Machine.(7)


ii. Describe a Turing Machine M to implement the function “multiplication” using the
subroutine copy(6)(Nov-13)
(Or)
b. i. Construct a TM to reverse the given string {abb}. (6)
ii. Explain Multi tape and Multi head Turing machine with suitable example.(7)

14.a Express the following grammar G into Griebhak Normal Form(GNF) (13)
S->XA|BB B->b|SB X->b A->a
(Or)
b. i. Summarize in detail about multihead and multitape TM with an example.(7)
ii. Construct a Turing Machine to accept palindromes in an alphabet set
∑={a,b}.Trace the strings “abab” and “baab”.(6)

15.a. i. Explain about PCP.(7)


ii.Show that the characteristic function of the set of all even number is
recursive .(6)
(or)
b . Prove that the universal language is recursively enumerable but not recursive.
Generalize your answer(Nov-12)
Part-c 1*15=15
16. a. . Describe about Recursive and Recursive Enumerable languages with example.(7)
ii. State and describe RICE theorem.(8)
(or)

n n
b. i. Examine whether the language L=(0 1 | n>=1) is regular or not? Justify your
answer (Dec-14)

You might also like