Theory of Computation (Automata)

Identify the correct definition of String (formal language).

• A. The sequence of production rule applications used to generate a string from a grammar's start symbol.
• B. The process of reducing a deterministic finite automaton to the smallest possible number of states while preserving its language.
• C. A finite sequence of symbols drawn from an alphabet. ✓
• D. A grammar for which some string can be generated by more than one distinct derivation tree.