Lecture 6 (Computation Theory) Nondeterministic Finite Automata and Regular Expressions

In the lecture's NFA construction for the union A₁ ∪ A₂, the new start state q₀ is connected to the two old start states by:

1. A.A single deterministic arrow labeled with every input symbol
2. B.Two ε-transitions, one to each old start state
3. C.An arrow labeled by the shared alphabet Σ
4. D.A pair of arrows labeled 0 and 1 respectively