Question 1: Given an NFA described by the 5-tuple $(Q, \Sigma, \delta, q_{0}, F)$, what is the range of the transition function $\delta$?
(3 points)
A. $Q$
B. $\Sigma$
C. $P(Q)$
D. $Q \times \Sigma$
E. $F$
Question 2: For an NFA, how many transitions (edges) may exist for a given state (node) when reading a particular input symbol from the language’s alphabet?
(3 points)
A. Exactly one
B. None
C. More than one
D. Any of the above
Question 3: Which of the following expressions is equivalent to $A^{+}$?
(3 points)
A. $A>A^{*}$
B. $A+A^{*}$
C. $A^{**}$
D. $A^{\circ}A^{*}$
E. $A \neg A^{*}$