Subject: Theory of Computation

Note: Question is given in the Picture. Here in chegg already have a solution. but i need using Draw this DFA/NFA.

Here is the answer

===> Answer this using DRAW this DFA/NFA/Extended Transition Function Table

1. [ 0,1,...,9 0,1,...,9 Start E,+,- 90 91 92 93 0,1,...,9 0,1,...,9 44 (a) Using extended transition function show if the following inputs are accepted by the E-NFA i) eln 5.6 ii) x2-1 Example 1: ein 5.6 = 5.6 This input is accepted by the automata. here the input is 5.6. Let's start from "q0". Since there is no sign in 5.6, we assume the sign as (Null). So, we make the transition to "97". At "q1" we have seen the digit "5" and can make a transition to "q4". At "q4" the given input is the decimal point (.). So we make a transition to "q3". At "q3" we consume the input "6" and make a transition to "q3" itself. Since w have consumed the entire input we make a transition to "q5" on input "s". Since after consuming the input "5.6", we have reached the final state "q5". So the input "eln 5.6" is accepted. Example 2: x2-1 Here the given input is not accepted, because the automata designed to accept only numbers with decimal point and sign. Lets start from "q0". Since we can make the transition from "q0" to "q1" with input null (8), we can reach up to "q1". After that, automata is expecting a digit or decimal point, but here as per the input, the automata will receive "x2", Which is not defined in automata. So we reach a dead state situation and the automata cannot proceed further. So the given input "x2-1" is not accepted by automata