@redstarfish Yes. A DFA either accepts or rejects a given word, and the language it recognises is the set of accepted words.
Therefore, languages A and B are both "the set of words that are accepted by M".