Theory of Computation (Automata)

In computer science, Formal language refers to which of the following?

• A. The concept where a DFA and an NFA are considered equivalent because they recognize exactly the same class of languages.
• B. A grammar for which some string can be generated by more than one distinct derivation tree.
• C. A set of strings composed of symbols from a defined alphabet. ✓
• D. The process of reducing a deterministic finite automaton to the smallest possible number of states while preserving its language.