We say that a finite machine $$M$$ [...] if $$A = \{w | M \text{ accepts } w \}$$. A language is called a [...] if some finite automaton recognizes it.