Language of a DFA

A DFA may accept certain words, while may reject others. If we collect all words accepted by a DFA $A$, we obtain a language: the language of a DFA $A$ is: ?

$$L(A)=\text{set of all words over its input alphabet that }A\text{ accepts}$$