Consider the following NFA on the alphabet E- (4.b) 1. Describe the language accepted by this grammar. Desribe it as a set of general string patterns (eg. L- (abba) etc) 2. Complete the transition table for the NFA. If transitions for a symbol not defined leave that cell as or empty b q0 q1 92 3. Convert the NFA to a DFA. Show the DFA and the transition table. Curcle all the states that are new accepting states. 90 q1 Q2

NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Identify the productions of the phrase-structure grammar for each of these languages, where S is the starting symbol.     The set of all bit strings made up of a 1 followed by an odd number of 0s   Multiple Choice A) S → S00 and S → 10 B) S → 1S00 and S → 10 C) S → 00S and S → 110 D) S → 0S and S → 10

Computer Science Consider the following two grammars with alphabet a and b i. (b*ab*a)*b* ii. (b*ab*a)*b*(b*ab*a)*b* Are there any strings are generated by one of the grammars and cannot be generated by the other? If there are more than one such string, how do you describe them.

Check whether the given grammar G is ambiguous 1. Sasb | SS 2. SE or not.