Scribd
Upload
52 views3 pages

B-Tech-SEM-6 (CE-IT) 2013

This document appears to be an exam for a course on theory of computation. It contains 6 questions with multiple parts for each question. The questions cover topics like recursive definitions, formal languages, regular expressions, finite automata, context-free grammars, Turing machines, and pushdown automata. The exam tests students' understanding of fundamental concepts in automata theory and formal languages.

Uploaded by

Vishal Kamlani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
52 views3 pages

B-Tech-SEM-6 (CE-IT) 2013

This document appears to be an exam for a course on theory of computation. It contains 6 questions with multiple parts for each question. The questions cover topics like recursive definitions, formal languages, regular expressions, finite automata, context-free grammars, Turing machines, and pushdown automata. The exam tests students' understanding of fundamental concepts in automata theory and formal languages.

Uploaded by

Vishal Kamlani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

\

Time: 3 Hours
Instruetions:
Q-l tAl
IBI
Q-l tAl
IBI
IC1
Q-2 lAl
I4I
t6l
t41
VI
t6l
tcl
Student
Exam No.
G^c,wpar
Uxrvf,RsrrY
B, Tech. Semester
VI Computer
Engineering/Information
Technology
Regular
Examination
May-June
2013
2CE60Lt2lT
601: Theory of Connputation
Total Marks: 70
L. A1l questions are comPulsory
2. Figures to the right indicate
fuIl marks'
3. A-iswer Both Sections
in Separate
Answer sheets
SECTION
-
I
Give recursive
definition
of each of followings'
'
t4l
1, The set N of all natural numbers'
2. The language
of strings of palindromes'
In each case, say whether the statement
is a tautology'
a contradiction
or neither' Give
I4l
supporting
proof.
1.
Qn
( P- - - +Q)
2.
(P
-'
Q)
n (-P
-+
q;
Prove using mathematical
induction
that for every n>:1
I
i*2i
=
( n-1)* 2n+r
+ 2
OR
Write rectrsive
definition
of language
of strings
with more
a's than b's' Prcve that
REV
(x
v)
=
REV
(y) REV
(x) for two string x'
y of some alphabet'
State whether
following
statements
are true or false'
Also
give reason'
f. if1+1:3,
then 1+2:3
2. 2+4=3 orrly
if 2+2=4
Show that the statements
P v
Q
v R v S and
(-P'^'
-
Q'r
-R)
)S are equivalent'
Find the regular expression
for FA in following
Fig' A and B'
i ,'ff
a\ ' /
\
a"/b
]\
Fig. B.
Fig. A.
Page
1 of3
\
t6l
Isl
Q-2
[B]
Convert following NFA given in Fig. B to DFA using subset construction.
Fig. B.
OR
[Al
In each case, find a string of minimum length in
{0,1}x
not in the ianguage
conesponding to the given regular expression.
1. 1* (0i )* 0*
2. (0* + 1*) (0* + 1*) (0* + 1+)
3. 0*
(100*)
1*
[B]
Draw DFA corresponds to following regular expressions
1. ( 11+ 10
) *
2. (0+1) (0+1) (0+1)
[A]
Draw NFA-null using KLEEN' s theorem part-I for(0+1)* 0+ (10+01)*
lBl
Let M:(Q,),qs, A,6) be an NFA
-
null, where
Q={qo,qr,qz,q:}' l={0,1},
A={q}
and 6 is given by the following table.
q 6(q,o) 6(q,1) 6(q,")
qo
{qo.
qr}
qr
{9zy
q2
{9:1
q3O
f i nd 6*(qs, 11), E*(qo, 001)
t6l
I6I
{q0}
{qr}
{Qr1
a
{Qt 1
{qo,
q2}
tq3)
{9t 1
Page2 of3
Dedve regular CFG for the followins FA.
Q-4
Q-s
[B]
Using pumphg
lemma for reguiar language prove that language
g=
10ili I
i
>=0]
is
[6]
not a regular langrrage.
OR
[A]
Give a grammar
which has "Dangling Else" problem.
Also draw the derivation tree.
t6J
tBl
-Sjo*,
u,sinC-tle.qylping lernma for CFL rhat the given
language L is not a CFL.
16l
Where, L
=
1an
b'n an / n>:0]
[A]
Draw a TM (Turing
Machine) accepting language of palindrome
strings.
t6l
[B]
consider the language of all balanced strings involving two t]?es of brackets
tl {}. tsl
CFG with productions
are :
s->ssl t sl l {s}l ^
Give transition table for Deterministic PDA accepting the above language.
OR
Q-5 [A]
For the following FA find a minimum state FA recognizing the same language.
t61
IB1
Q-6 tAl
IBI
Convert the foliowing CFG to Chomsky normal form (CNF)
S) TU
I
D, T) aTb
1" ,
U) bUl
^,
D) aDb
I
W, W+ bWl
^
Give transition table for PDA coresponds to followi:rg language
S) aSal bSb{ al bl ^
End ofPaper
tsl
t6t
t6l
Page 3 of3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy