We introduce the idea of pushdown automata with the ability to flip
its stack. By bounding the number of times the stack can be flipped
we obtain a hierarchy of language classes from the context free
languages to the recursively enumerable languages. We show that each
class in the hierarchy is nonempty and conjecture that the hierarchy
is strict. Also we provide some interesting open problems for this
new kind of automata.