1 Answers
In computer science, more particular in the theory of formal languages, a counter automaton, or counter machine, is a pushdown automaton with only two symbols, A {\displaystyle A} and the initial symbol in Γ {\displaystyle \Gamma } , the finite set of stack symbols.
Equivalently, a counter automaton is a nondeterministic finite automaton with an additional memory cell that can hold one nonnegative integer number , which can be incremented, decremented, and tested for being zero.
4 views
Answered