a) Difference between NFA &DFA
b) Design a Moore machine for binary adder. Clearly list al components that make up the machine.
c) Design a finite automata with output ot check divisibility by 3 to binary number
d) Design a Mealy machine to change every occurrence of a with x, b with y and c is kept unchanged. Convert the same to equivalent Moore machine.
e) Design DFA that accepts Strings that are multiples of 4 ∑={0,1}.
f) Design NFA that accepts strings starting with a and ending with a or starting with b and ending in b.
g) Applications of FA
h) Find minimum state Finite Automata accepting (010 + 10). First deign a NFA 10 with epsilon moves.
i) Design a Mealy Machine ot identify fi string starts with prefix ab over {a,b}*.
j) Construct a DFA for accepting all strings over {a,b} with substring abb.
k) Compare DFA and PDA
a) Construct the finite automata equivalent to the following regular sets:
i) 10+ (0+11)0*1
ii) 01(01)+111+0)*1
b) Write a short note on Pumping Lemma for regular language. Prove L= {a^2n .b^3n | n>0} is not a regular language using pumping lemma.
c) Write a short note on Arden's Theorem
d) Explain Pumping Lemma for regular languages. Prove that given language is not a regular language. L={ a^n b^(n+1) | n>=1}
e) State closure properties of Regular languages
f) Find regular expression (RE) for al strings starting with b and ending ni ba over {a,b}. Design NFA with epsilon moves for this RE. Convert it to equivalent DFA.