#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

A set of accepting states (F ∈ Q).

Answer

F