In an automata or formal-language problem, which option best represents start state?

A. the state that must always be accepting B. the state where the automaton begins processing input C. the last non-terminal of a grammar D. the final symbol of every string