1. Apply the general constructions given in the lectures to construct the minimum-state DFSA which recognises those strings that match the regular expression:

Apply the general constructions given in the lectures to construct the minimum-state DFSA which recognises those strings that match the regular expression: [10 marks] 0 | [1-9] [0-9]* |0[1-7] [0-7] * | Ox [1-9A-F] [0-9A-F] * | [0-9] [0-9] * . [0-9]* Note: This is a simplified form of the regular expression we developed in the lectures to match numerical constants in the format specified by the C programming language. Now examine the finite state automaton you've constructed, and observe that it has five (5) accepting states. We can use the accepting state that this automaton ends up in when scanning a string to classify that string into one of the following subclasses of numerical constant zero, decimal, octal, hexadecimal and real. For each accepting state in your automaton, say which kind of numerical constant will cause the automaton to terminate at that state. [2 marks]