Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Download
Standard view
Full view
of .
Look up keyword
Like this
1Activity
0 of .
Results for:
No results containing your search query
P. 1
TH OF COMPUTATION

TH OF COMPUTATION

Ratings: (0)|Views: 97|Likes:
Published by api-3782519

More info:

Published by: api-3782519 on Oct 16, 2008
Copyright:Attribution Non-commercial

Availability:

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

03/18/2014

pdf

text

original

B. E. VIth Semester Computer Science Engg. Examination
THEORY OF COMPUTATION Paper-CSE-310-C567
Time allowed:3 hours
Maximum Marks:l Oa
Note: Attempt anyfi ve questions.
1.
(a) Givefo r ma l definition of finite automata which will
accept all binary strings with even number of zero and
ones.Al s o draw the transition diagram. 6

(b) Let L be a set accepted by non-deterministic finite automation. Then prove that there exists a deterministic finite automation that accepts L. Construct aDFA for following NFA.

M= ({qo' qj}, {O, I},S,~ , {qd) where
S (~, 0) = {~, qj}, S (qo' I)= {ql}, S (qJ' 0)= cp
S(q"l)={CJo,q,).
14
2.

Why finite automater with output is needed? Write a procedure for converting a Mealy machine to Moore machine? Apply the procedure to the following Mealy machine. 20

567-~.()O().-P-2_Q_8(' \i )
P.T.O.

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)//-->