A FIFO automaton is defined like a Push Down Automata except that instead of the stack, it has a first-in-first-out queue. When a FIFO automaton pushes a symbol, it is stored on the right-hand end of the queue; when it pops, the leftmost symbol is read and removed from the queue. Show that a language can be recognized by a deterministic FIFO automaton iff the languages is Turing-recognizable.