A counter is a stack with an alphabet of exactly two symbols a stack start symbol and a counter symbol. Only the counter symbol can be put on the stack or removed from it. A $\text{counter automaton}$ is a deterministic automaton with one or more counters as storage. Show that any Turing machines can be simulated using a counter automaton with four counters.
