MIDTERM SPRING 2012
CS402 – Theory of Automata
Q. Point of Kleen Theory.
Answer:- (Page 25)
1. If a language can be accepted by an FA then it can be accepted by a TG as well.
2. If a language can be accepted by a TG then it can be expressed by an RE as well.
3. If a language can be expressed by a RE then it can be accepted by an FA as well.
Q. Difference and common between NFA & DFA
Answer:- (Page 25) Click here for detail
Difference
1-In FA Finite number of states, having one initial and some (maybe none) final states. While in NFA Finite
many states with one initial and some final state.
2-In FA for each state and for each input letter there is a transition showing how to move from one state to
another while in NFA there may be more than one transition for certain letters and there may not be any
transition for certain letters.
3-In FA is valid while in NFA is not valid.
Common
Finite set of input letters,
MIDTERM SPRING 2012
CS402 – Theory of Automata
1) What is the function of mealy machine?
Answer:- (Page 60)
1's complementing and incrementing machines which are basically Mealy machines are very much helpful in
computing.
The incrementing machine helps in building a machine that can perform the addition of binary numbers.
--
Zindagi mein 2 Logo ka buhat khayal rahkoooo
Ist woh jiss ney tumhari jeet ke Liye buhat kuch hara hoo
(Father)
2nd woh jiss ko tum ney har dukh me pukaara hoo (Mother)
Regards,
Umair Saulat Mc100403250
--
--
For study materials, past papers and assignments,
Join VU School at www.vuscool.com
Facebook Group link
http://www.facebook.com/groups/vuCoooL CoooL Virtual University Students Google Group.
To post to this group, send email to coool_vu_students@googlegroups.com
home page
http://groups.google.com/group/coool_vu_students?hl=en
