www.aktuonline.

com

Printed Pages : 3 RoII N0. NC5402

B.TECH.
THEORY EXAMTNATTON (SEM-IV ) 2Ot6-17
THEORY OF AUTOMATA AND FORMAL LANGUAGES
Time : 3 Hours Mox. Marks : 100
Note : Be precise in your answen In case of numerical problem assume data wherever not provided,

SECTTON-A
l.

(c)
www.aktuonline.com

(d)

(e) Check whether the grammar is ambiguous or not.

R-> R+R/ RR/ R*/ a I b I c. Obtain the string w
= a+b*c
(f) S->aBlbA A->a/aS/bAA B-> b/bS/aBB. Identify the sfiings obtained from this
grammar.
(e) Define PDA. Draw the graphical representation for pDA.
(h) Design a PDA which accepts set of balanced paranthesis (
(i)
{
{ } } ).
Eliminate unit productions in the grammar. s->A/bb A->B/b B->s/a
fi) What are checking off symbols?

SECTION-B
, Attempt any five of the following questions!
At
5x10=$[
(a) (i) Convert the NFA- e to DFA,

www.aktuonline.com
 www.aktuonline.com

(ii) Check with the comparison method for testing equivalence of two FA given
below.
*i*u'".*"',u"**ffi
.-'ffi*,I*}ffi'-
t**"*=fiU******=1
*r,n -tl*t**
ru',r*-u-ira".ffi ="u.,...'
,..'il"t=i.u**ttt"t
tll.,J,ft

-
i:!.::::r::::::ill
: . ::{:.::i::::l::..i
.i:,;:.'::
',::]j:.,}]:i,:i,|1:,]'

****n*******o**ffi '* ... --******"*******ffi

:: ::::: i: ::; ::: ::.:: t::: .a::__t:t_':::::..i:ltaij-:j:::i;!|

iifl lil:li fi*liffir:i

i.l,:,,,''.f:..,,,i.;i,;.,i,1:,i
tiii+1i;',',:.ry
:,iiii.iil;Ji..,:,'..
F_.:-::.:::*

.:,.''i;i.:.;i.
:r..

":i:r::.:::: :
:...

,,.
i:'
j
:':.
r 1..:::.

1:
,iiili,::,.:.l,.,,.1.lt,t,:",l::li'l:L:ii,t-.rri,;llil.liiliil,::;::ll:l,l:iii:liili
, ,',','.......
: 'll,....;....,.';.;.,,i....;..r',,,.. ::,l.,
'
,....,..,,.: i.,:' .X:.r,
. i
,,i.ii,:::.,.i.i:,,:,:t,
,,,
....,:.,.,.i,:::
.,.t,t,:.:,:
:::i::: , ..:
.l::, .,.t..,,,,,i.:.::i;,;,,...;.;:....a
',.,,.,",
:;::::':::i., . ,: ,:
,,.i.,,..',*irti
.,,,; :i :i'ii',
:: : ,:., ,

(b) Prove that the compliment, homomorphism and hornomorphism, closure of a

regular language is regular.
(c)
www.aktuonline.com

State and prove kleene's theorem with an example'

(d) Consider the grammar with the production S->aSS A->b' Compute the string
aababbb

with the left most and right most derivation. Draw the derivation tree.
(e) (i) Find out whether the language 1 = {xnfzn I n} I } is context free or not'
(ii) Construct a PDA that accepts 1= { wwR I w = (a+b)* }
(f) (0 Convert the following CFG into CNF
S --+ Xy lxn lp
X --r mX Im
f-+Xnlo
(ii) convertthefollowingcFGintocNF s-+ASAlaB,A**B I S,B-+ble
(g) Design a TM to recognize all strings consisting of an odd number of c's.
(h) Prove that the halting problem is undecidable'

SECTION _ C
Attempt any two of the following questions:
2x 15 = 30
3. (a)(a) Minimize the autornata
automata given below

www.aktuonline.com
 www.aktuonline.com

(b) Compute the epsilon- closure for the given NFA. Convert it into DFA.

4. (a) Construct PDA to accept L= {0o ln I n :,0}

(b) Construct a PDA frorn the following CFG,
G: ({S, X}, ta, b}, P, S) where the productions are -
S-+XSle,A-+axblAblab

5, (a) Prove that single tape machines can simulate multi tape machines.
(b) Design a TM to recognize all strings consisting of an odd number of c's.
www.aktuonline.com

www.aktuonline.com