Counting languages are those languages which can be recognized by a counter automaton, which is a DFA with counters.

Arthur-Merlin is an interactive proof system involving a TM and an untrustworthy oracle.