Q1.
a) Let L be a language over {0, 1} in such a way that each string begins with a 0 and ends with a minimum of two subsequent 1’s. Create:
a) The regular expression to identify L.
b) A finite state automata M, in such a way that M (L) = L.
c) A regular grammar G, in such a way that G(L) = L.
Q2. Find out the values of the given prefix notation:
+, -, -, 3, 2, -, 2, 3, /, 6, –, 4, 2
Q3. Determine the state table for the NFA with state diagram shown below.