Answer Happy

Q1A: Explain the differences amongst DFA, NFA, and ε-NFA in
the theory of computation with at least two (2) relevant
practical examples of each.
B. Give a formal definition of the string accepted by an NFA
and ε-NFA
C. Design a DFA that accepts all strings
over {0, 1} that have 001 as a substring, where
p is a substring of w if there
are w0 and w1 such
that w = w0 p w1.
D. Convert the DFA in C above to an equivalent NFA
E. Given the below ε-NFA;
i) Determine the set of substrings accepted by
the ε-NFA
ii) Determine the ε-closure of all possible states
of the ε-NFA
ii) Derive the state transition table associated with
the ε-NFA