* :The output alphabet sign in Moore and Mealy Machine can be represented as a) 8 O b) A O c) d) None of the mentioned O * ?Which one of the following grammars is a Non-Linear Grammar a) SSS O b) SaSb c) S Ab Given the language L = {ab, aa, baa}, which of the following strings are in L*? 1) * abaabaaabaa 2) aaaabaaaa 3) baaaaabaaaabaa a) 1, 2, 3 b) 2,3 c) 1,3 d) 1 O * Write the regular expression for even number of a's by using the following DFA 90 91 b b a) (blab*ab)* O b) (blab*ab*) c) (bab*ab+)* d) (blab*ab*)* *.Construct a DFA, accepting all strings ending with ab over { ={a, b} b) a) ? Which of the given are correct a) Moore machine has 6-tuples b) Mealy machine has 6-tuples c) Both Mealy and Moore has 6-tuples d) None of the mentioned :Moore Machine is an application of a) Finite automata with output b) Finite automata without input c) Non-Finite automata with output d) None of the mentioned Convert the following Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA) 0 0 qo 91 1 1 q0q1 T T 0,1 0,1 9091 0,1 0,1 b) O a) 9091 90 T 0 0,1 0,1 T 4091 0,1 0,1 D How many strings of length 3 are ending with "b" are possible over alphabet * ?{a,b} a) 4 O b) 2 O c) 3 d) 8 -=|If W = a1 a2 a3 1 an, the length of lw a) n-1 b) n c) n+1 O d) 1 O