www.rejinpaul.

com

Anna University, Chennai Nov/Dec 2012 Examinations

Rejinpaul.com Important Questions
CS2303 Theory Of Computation
V Sem CSE
Unit I-V
1. Consider the following NFA. Compute the closure of each state and find its equivalent DFA

2.
3.
4.

5.

a
b
c
p {q} {p}
q
{r}
{q}
*r

{r}
Construct a NFA over the alphabet {0,1} that accepts all strings end in 011
Construct a DFA that accepts all the strings on {0,1} except those containing the substring 101
Consider the following NFA. Compute the closure of each state and find its equivalent DFA

a
b
c
{q,r {q} {r}
p }
q
{p} {r} {p,q}
*r

Construct an NFA without transitions for the NFA give below

6. Construct the NFA For the given regular expression Using Thompsons and Construct DFA For the

above NFA and find the Minimized DFA? (a+b)*.a.b

7. Find the regular expression for the set of all strings denoted by R133 from the deterministic finite automata
given below

8. Obtain the regular expression for the finite automata

9. Draw the table of distinguish abilities for this automaton & Construct the minimum state equivalent DFA

10. Construct PDA for the given CFG SaSb Sab

www.rejinpaul.com

Page 1

www.rejinpaul.com

11. Suppose the PDA P= ({q,p},{0,1},{Z0,X}, ,q, Z0,{p}) has the following transition function

1. (q,0, Z0) ={(q, XZ0)}

2. (q,0, X) = {(q,XX)}
3. (q,1, X) = {(q,X)}
4. (q,, X) = {(p,)}
5. (p,, X) = {(p,)}
6. (p,1, X) = {(p,XX)}
7. (p,1, Z0) = {(p,)} starting from the intial ID (q,w, Z0), show all the reachable IDs when
the input w is a) 01 b) 0011 c) 010.
12.
Show that set of all strings over {a,b} consisting of equal number of as & bs is accepted by a deterministic PDA
13.
convert the grammar S aSb /A, A bSa | S | to aPDA that accepts the same language by empty stack
14.
Construct the PDA for L = { wwR | w is in (a+b)* }
15.
Design a Turing Machine M for the language L = { 0n1n0| n > = 1 }
16.
Show that L= {an bncn | n 1} is not a context free language.
17.
Convert the grammar S AB,A BS/b, B SA/a into Greibach Normal form
18.
Design a Turing Machine M for f(x,y)=x*y where x,y are stored in the tape in the form of 0X 10Y 1
19.
Simplify the following grammar and find its equivalent in GNF S AA/0, ASS/1
20. Define Universal Language Lu, Show that Lu is recursively enumerable but not recursive
21.
Explain in detail about undecidable in Turing machine
22.
Let = {a,b}*. Let A and B be lists of three strings as given below: A = {b,bab3,ba} and b= {b3, ba, a} Does this
instance of PCP have a solution?
23.
Discuss the difference between NP complete and NP hard problems

www.rejinpaul.com

Page 2