# What if I replace a stack with a queue?

Suppose I have a PDA $P$. What if I replace its First-In-Last-Out stack with a First-In-First-Out queue?

Is this new machine with a queue just as powerful as a PDA? Can it represent the same languages? I feel that it can because we can still count input with it. Does that make sense?

-
You get math.queueexchange.com. –  Asaf Karagila Oct 21 '12 at 10:41