the transition function of e-NFA machine is given by Qx --> EU {E} [ UE} O QxEU {f} -->Q O QxEU {f} --> 2 power Q O QxEU {E} --> Q power 2 O Determine the final walk of the following extended Transition Function (((q0, * ?X), a , b) by using the following machine a,b b a 91 b 195 a,b b 93 a 94 92 90 b a) 42 b) 93 c) 94 d) 45 The finite automata is called NFA when there exists ------- for a specific input * ? from current state to next state Single path Only two path Multiple path None of them * ?------- Regular expressions are closed under a) Union b) Intersection c) Kleene star d) All of the mentioned ? Which one of the following is correct a) Every NFA is an, DFA but not vice versa O b) Every DFA is an NFA, but not vice versa * : The Regular Languages of the following machine is b b a (90) 91 a+b (92) b a) r = (bb* a)* bb* (a+b)* O b) r = (bb* a) bbt (a+b)* O c) r = (bb* a)* bb* (a+b) b* O For a give Moore Machine, Given Input='101010', thus the output would be of *:length a) Input[+1 b) |Input o c) |Input-11 O The equivalent DFA table of the NFA machine is A () 8 0 1 | BB TT T 8 | 0 1 ) ) 5 10 1 5 o 4 How many strings of length 2 and starting with "a" are possible over alphabet (= * ?{a,b} a) The strings are aa, ab b) The strings are ba, ab c) The strings are aa, ba d) The strings are ab, ba * If L= {a, aa, aaa, ab ....................}, then the string .... a) w = baba is in the language means WEL O b) w = baba is not in the language means WEL