Answer

Correct Option: (iii) Generator (also enumerated as Transducer/Enumerator in some texts — “Generator” is the term for printing strings)

Explanation

TM views:

Mode	Description
Acceptor / Recognizer	Decides $w\in L$ by accepting/rejecting (yes/no).
Transducer	Computes function $f(w)$ on output tape.
Generator / Enumerator	Prints (generates) strings of $L$ one after another on output tape (printer).
Decider	Acceptor that always halts.

A TM that prints strings of a language is called Generator (or Enumerator if it lists all). Many textbooks list (iii) Generator and (iv) Enumerator as synonyms; exam key typically Generator.

Final Answer

Generator (prints strings) → Option (iii). Enumerator is equivalent variant.