What is meant by accepting state in Theory of Automata and Formal Languages?

A. the symbol used for concatenation B. a state that indicates successful acceptance of an input string C. the only starting symbol of a grammar D. the state that erases the tape