Question: PLEASE DO PART C (a) The following is an NFA over the alphabet {a,b}. a 5 8 a b 3 b Determinize it using the
PLEASE DO PART C

(a) The following is an NFA over the alphabet {a,b}. a 5 8 a b 3 b Determinize it using the algorithm taught in lectures. (The DFA that you give need not be total.) Briefly explain the initial state of your DFA, and the a-labelled transition from it. [5 marks] (b) Prove that the following language over the alphabet [ = {a, b} is non-regular. L = {b5p+9 aPb9|p.9 N} Do not use the Pumping Lemma (a topic that has not been taught in this module). [5 marks] (c) The following is a partial DFA over the alphabet ? {a, b}. Make it into a total DFA (using the algorithm taught in lectures), and then prove that what you have obtained is minimal. [5 marks] a a 10 13 14 b b b b b 11 12 15 5 a
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
