Pushdown Permuter Characterization Theorem

There is a well-known class of algorithms for permuting symbols which has been formally characterized by a device called a pushdown permuter. Two theorems attempting to characterize the type of permutations that can be achieved by a pushdown permuter have appeared in the literature. Counter-examples to these theorems have also appeared in the literature. This paper presents a correct statement of this theorem.