Recognizability of languages via deterministic finite automata with values on a monoid: General Myhill-Nerode Theorem.