# Counter automaton

In computer science, a counter automaton is a Pushdown automaton with only two symbols, A and the initial symbol in $\Gamma\,$ (the finite set of stack symbols). This class of automata can recognize a subset of Context free languages, for instance the language:
$\{\ a^nb^n : n \in \mathbb{N} \}$