 The class of counter automata can recognize a proper superset of the regular and a subset of the deterministic context free languages.For example, the language formula_3 is a non-regular language accepted by a counter automaton