Aqueue automaton is like a pda except that the stack is replaced by a queue. a queue is a tape allowing symbols to be written only on the left-hand end and read only at the right-hand end. each write operation (we’ll call it a push) adds a symbol to the left-hand end of the queue and each read operation (we’ll call it a pull) reads and removes a symbol at the right-hand end. as with a pda, the input is placed on a separate read-only input tape, and the head on the input tape can move only from left to right. the input tape contains a cell with a blank symbol following the input, so that the end of the input can be detected. a queue automaton accepts its input by entering a special accept state at anytime. show that a language can be recognized by a deterministic queue automaton if and only if the language is turing-recognizable.