Answer

Correct Option: (iv) Output tape (is NOT a component)

Explanation

Finite Automaton (DFA/NFA) formal definition: $M = (Q, \Sigma, \delta, q_0, F)$

Components:

1. $Q$: Finite set of states
2. $\Sigma$: Input alphabet
3. $\delta$: Transition function $Q\times\Sigma \rightarrow Q$ (or $2^Q$ for NFA)
4. $q_0 \in Q$: Start state
5. $F \subseteq Q$: Set of accepting states

Output tape belongs to Turing Machine or Transducer (Mealy/Moore), not to basic finite automaton. FA has no output tape; it only accepts/rejects.

Note: $\epsilon$ and stack are for PDA, tape for TM.

Final Answer

Output tape is not a component of FA → Option (iv).